Online semi-matching problem with two heterogeneous sensors in a metric space
From MaRDI portal
Publication:6113875
DOI10.1007/978-3-031-22105-7_39MaRDI QIDQ6113875
Publication date: 10 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching
- On-line algorithms for weighted bipartite matching and stable marriages
- Online matching on a line
- Online bottleneck semi-matching
- A \(o(n)\)-competitive deterministic algorithm for online matching on a line
- Online bottleneck matching
- The Prize-collecting Call Control Problem on Weighted Lines and Rings
- The Online Metric Matching Problem for Doubling Metrics
- Randomized online algorithms for minimum metric bipartite matching
- A Robust and Optimal Online Algorithm for Minimum Metric Bipartite Matching
- Competitive analysis for two variants of online metric matching problem
This page was built for publication: Online semi-matching problem with two heterogeneous sensors in a metric space