Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
From MaRDI portal
Publication:5479367
DOI10.1007/11538462zbMath1142.90438OpenAlexW2649657569MaRDI QIDQ5479367
Publication date: 7 July 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11538462
Related Items (5)
A Fast $$(2 + 2/7)$$-Approximation Algorithm for Capacitated Cycle Covering ⋮ Perturbation resilience for the facility location problem ⋮ On min-max \(r\)-gatherings ⋮ On Min-Max r-Gatherings ⋮ A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering
This page was built for publication: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques