Online bottleneck matching on a line
From MaRDI portal
Publication:6110959
DOI10.1007/s10878-023-01036-3zbMath1527.68263MaRDI QIDQ6110959
Jin-Hua Yang, Man Xiao, Shu Zhao, Weidong Li
Publication date: 6 July 2023
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Serve or skip: the power of rejection in online bottleneck matching
- A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching
- On-line algorithms for weighted bipartite matching and stable marriages
- An optimal deterministic algorithm for online \(b\)-matching
- Online matching on a line
- Online bottleneck semi-matching
- Greedy metric minimum online matchings with random arrivals
- A \(o(n)\)-competitive deterministic algorithm for online matching on a line
- Online bottleneck matching
- Online minimum matching with uniform metric and random arrivals
- The Online Metric Matching Problem for Doubling Metrics
- Randomized online algorithms for minimum metric bipartite matching
- The Online Transportation Problem
- A Robust and Optimal Online Algorithm for Minimum Metric Bipartite Matching
- Competitive analysis for two variants of online metric matching problem
- Online facility assignment
- Online semi-matching problem with two heterogeneous sensors in a metric space
This page was built for publication: Online bottleneck matching on a line
