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.
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.
Cut Sparsification and Succinct Representation of Submodular Hypergraphs
Explore cut sparsification of hypergraphs, focusing on submodular functions. Learn about new bounds, polynomial bounds, and succinct representation techniques for various submodular function families.
The Approximate Structure of Triangle-Free Graphs
Explore the structure of dense triangle-free graphs and learn about efficient algorithms for computing their approximate representations using smaller graphs.
Sketching Techniques for Data Structures and Optimization - Part 2
Explore advanced sketching techniques for data structures and optimization in fast algorithms, focusing on practical applications and theoretical foundations.
Sketching Techniques for Data Structures and Optimization - Part 1
Explore data structure optimization techniques for fast algorithms, focusing on sketching methods to enhance computational efficiency and performance.
An Improved Quantum Max Cut Approximation via Maximum Matching
Discover groundbreaking improvements in Quantum Max Cut approximation through maximum matching techniques, achieving a 0.595 approximation ratio using simplified 2-qubit state outputs.
A Brief Introduction to Algorithms, Game Theory and Risk-Averse Decision Making
Explore algorithms, game theory, and risk-averse decision making, covering shortest paths, NP-Complete problems, equilibria, and various risk frameworks for real-world applications.
Breaching the 2-Approximation Barrier for Connectivity Augmentation
Explore connectivity augmentation, including incident links, Steiner tree reduction, and approximation algorithms. Learn about recent advances and open problems in this field.
Approximation Algorithms for Hard Augmentation Problems - Lecture III
Explore advanced network design techniques for increasing graph connectivity, focusing on recent approaches and advances in augmentation problems like Tree Augmentation and Connectivity Augmentation.
Randomized Composable Core-Sets for Submodular Maximization
Explores randomized composable core-sets for distributed submodular and diversity maximization, presenting improved algorithms and analysis techniques for big data optimization problems.
PCPs and Global Hyper-contractivity - Lecture 1
Explore advanced concepts in theoretical computer science, focusing on Probabilistically Checkable Proofs and global hyper-contractivity with expert Dor Minzer.
PCPs and Global Hyper-contractivity - Lecture 2
Explore advanced concepts in PCPs and global hyper-contractivity with Dor Minzer, delving into complex mathematical theories and their applications in analysis and theoretical computer science.
PCPs and Global Hyper-contractivity - Lecture 1
Explore advanced concepts in theoretical computer science, focusing on Probabilistically Checkable Proofs and global hyper-contractivity with expert Dor Minzer.
Approximation Algorithms
Explore approximation algorithms for network design, including connectivity augmentation, Steiner trees, and spectral rounding techniques. Learn about linear programming and future research directions.
Asymmetric Traveling Salesman Problem: Advances and Challenges - Session 1A
Explore cutting-edge research on the Asymmetric Traveling Salesman Problem, including algorithms, lower bounds, and approximation results in this advanced theoretical computer science talk.
An Improved Approximation Algorithm for ATSP
Explore an advanced approximation algorithm for the Asymmetric Traveling Salesman Problem, covering linear programming relaxation, reductions, and recursive techniques to improve solution quality.
Breaching the 2-Approximation Barrier for Connectivity Augmentation
Explore advanced techniques in network design, focusing on connectivity augmentation and its reduction to the Steiner Tree problem. Learn about novel approximation algorithms and open challenges in the field.