An \(O(\log n)\)-competitive posted-price algorithm for online matching on the line
From MaRDI portal
Publication:6606163
DOI10.1007/978-3-031-49611-0_4MaRDI QIDQ6606163
Kirk Pruhs, Stephen Arndt, Josh Ascher
Publication date: 16 September 2024
Cites Work
- Title not available (Why is that?)
- A poly-log competitive posted-price algorithm for online metrical matching on a spider
- Competitively pricing parking in a tree
- The Online Metric Matching Problem for Doubling Metrics
- On-Line Load Balancing of Temporary Tasks
- A $$o(n)$$-Competitive Deterministic Algorithm for Online Matching on a Line
- An O(log2 k)-Competitive Algorithm for Metric Bipartite Matching
- Randomized online algorithms for minimum metric bipartite matching
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- Online Weighted Matching
- Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing
- Approximation and Online Algorithms
This page was built for publication: An \(O(\log n)\)-competitive posted-price algorithm for online matching on the line
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606163)
