A Deterministic O(log m)-Competitive Algorithm for Online Minimum Cost Bipartite Matching with Delays
cs.DS
Submitted: 2026-11-01
Updated: 2026-11-01
Terminology
Sources
- Online Min-Cost Matching with General Arrivals
- Polylogarithmic Bounds on the Competitiveness of Min-cost (Bipartite) Perfect Matching with Delays
- Online k-Way Matching with Delays and the H-Metric
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