Approximation and Online Algorithms
From MaRDI portal
Publication:5896931
DOI10.1007/b95598zbMath1173.68865OpenAlexW4300520713MaRDI QIDQ5896931
Akash Nanavati, Elias Koutsoupias
Publication date: 11 August 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95598
Related Items (14)
A randomized algorithm for the on-line weighted bipartite matching problem ⋮ A poly-log competitive posted-price algorithm for online metrical matching on a spider ⋮ A \(o(n)\)-competitive deterministic algorithm for online matching on a line ⋮ Matching on the Line Admits no \(o(\sqrt {\log n})\) -Competitive Algorithm ⋮ Algorithms for online car-sharing problem ⋮ Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship ⋮ A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching ⋮ Permutation Strikes Back: The Power of Recourse in Online Metric Matching ⋮ Online matching on a line ⋮ Deterministic min-cost matching with delays ⋮ Online facility assignment ⋮ Competitive analysis for two variants of online metric matching problem ⋮ Greedy metric minimum online matchings with random arrivals ⋮ Unnamed Item
This page was built for publication: Approximation and Online Algorithms
