Tight Competitive Bounds for Online Matching on Forests
cs.DS
Submitted: 2026-11-09
Updated: 2026-11-09
Terminology
Sources
- Lossless Online Rounding for Online Bipartite Matching (Despite its Impossibility)
- Online Matching with General Arrivals
- Edge Arrival Online Matching: The Power of Free Disposal on Acyclic Graphs
- A New Lower Bound for Online Vertex Cover under Vertex Arrivals
- Online Algorithm for Fractional Matchings with Edge Arrivals in Graphs of Maximum Degree Three
- Optimal Competitive Ratio of Two-sided Online Bipartite Matching
- A Tight Bound on Online Vertex Cover under Edge Arrivals
- Online Vertex Cover and Matching: Beating the Greedy Algorithm
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time