A* Search: How Map Applications Find Shortest Routes
Explore A* search algorithm for optimal route finding, comparing greedy and uniform cost approaches. Learn how modern mapping apps balance efficiency and accuracy.
Geometric Variational Problems: Regularity vs Singularity Formation
Explore techniques for existence, regularity, and singularity formation in geometric problems, focusing on harmonic maps, Yang-Mills connections, and nematic liquid crystals. Learn about new gluing methods for parabolic flows.
Mathematical Foundation of Various MCMC Methods
Explore advanced MCMC methods for combinatorial optimization, including multi-spin flip techniques. Compare mathematical and numerical results to evaluate efficiency in different contexts.
Computational Origami - Harnessing Paper Folding for Problem Solving
Explore the computational power of paper folding, from basic arithmetic to solving cubic equations, using Python simulations and origami principles.
Parametric Continuity in Problems of Optimal Stopping with Applications to American Options and Stopping Games
Explore parametric continuity in optimal stopping problems, focusing on applications to American options and stopping games. Gain insights from cutting-edge research in mathematical finance.
Sparsifying Set Systems for Coverage Problems
Explore recent advancements in sparsifying set systems for coverage problems, focusing on sublinear graph simplification techniques.
Improved Streaming Algorithms for Max-DICUT via Local Snapshots
Explore advanced streaming algorithms for Max-DICUT problem, focusing on local graph snapshots to surpass the 4/9 approximation in sublinear space.
Approximating Maximum Matching Requires Almost Quadratic Time
Explore algorithms for estimating maximum matching size, focusing on recent advancements and lower bounds. Gain insights into subquadratic time complexity and its limitations in graph theory.
Online Algorithms for Spectral Hypergraph Sparsification
Explore online algorithms for spectral hypergraph sparsification, focusing on space-efficient methods for handling streaming hyperedges and producing accurate sparsifiers.
On (1 + ε)-Approximate (Vertex) Cut Sparsifiers
Explore advanced graph compression techniques for planar and quasi-bipartite graphs, focusing on high-quality cut sparsifiers and their size bounds. Analyze contraction-based approaches and their limitations.
Stochastic Minimum Vertex Cover with Few Queries: A 3/2-Approximation
Explore a 3/2-approximation algorithm for stochastic vertex cover using O(n/p) non-adaptive queries, improving upon previous 2-approximation methods and discussing extensions to correlated edge realizations.
Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemeredi Graphs
Explore advanced algorithms for dynamic maximum matching using Ordered Ruzsa-Szemeredi Graphs, improving update time to n^{o(1)} * ORS(n) and reducing the problem to a combinatorial bound.
New Algorithms for Directed Spanner Problems and Generalizations
Explore recent advancements in directed spanner algorithms, including online and offline settings, weighted variants, and buy-at-bulk extensions.
Dynamic Matching and Ordered Ruzsa-Szemerédi Graphs - Towards Constructive Matching Sparsifiers
Explore approaches for designing fast dynamic algorithms for approximate matchings, focusing on fully dynamic settings and the concept of matching sparsifiers in graph theory.
Maximum Matching in O(log log n) Passes in Dynamic Streams
Explore an algorithm for approximating maximum matching in dynamic streams, achieving O(1)-approximation in O(log log n) passes and O(n poly log n) space, with lower bound proof.
Planar Partition Oracles for Bounded Degree Graphs in Polynomial Time
Explore planar graph partition oracles for bounded degree graphs, focusing on hyperfinite decompositions and their applications in sublinear algorithms and property testing.
Conditional Sampling for Distribution Testing
Explore conditional sampling techniques for distribution testing, focusing on efficient algorithms and their applications in statistical analysis.
Toward Optimal Semi-streaming Algorithm for (1+ε)-Approximate Maximum Matching
Explore a deterministic algorithm for (1+ε)-approximate maximum matching, improving pass-complexity and advancing solutions in various computational models.
Low Degree Testing over the Reals
Explore low degree testing over real numbers, focusing on theoretical concepts and applications in local algorithms.
O(log log n) Passes is Optimal for Semi-Streaming Maximal Independent Set
Explore optimal passes for semi-streaming maximal independent set, focusing on O(log log n) algorithm and new lower bound proof using extremal graphs and round elimination techniques.
Subgraph Counting and Seed Counting in Graph Theory
Explore sublinear subgraph counting and sampling techniques, focusing on the advantages of counting seeds in graph analysis.