Algorithms - ESA 2003
From MaRDI portal
Publication:5897232
DOI10.1007/b13632zbMath1266.90117OpenAlexW1827234103WikidataQ60299159 ScholiaQ60299159MaRDI QIDQ5897232
Ranjithkumar Rajagopalan, Aaron Archer, David B. Shmoys
Publication date: 3 March 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13632
Integer programming (90C10) Discrete location and assignment (90B80) Approximation algorithms (68W25)
Related Items (11)
Approximation algorithms for hard capacitated \(k\)-facility location problems ⋮ Partial multicuts in trees ⋮ LP-based approximation for uniform capacitated facility location problem ⋮ Analytical aspects of tie breaking ⋮ Universal Algorithms for Clustering Problems ⋮ Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms ⋮ Local search algorithms for the red-blue median problem ⋮ Incremental medians via online bidding ⋮ Unnamed Item ⋮ Approximating $k$-Median via Pseudo-Approximation ⋮ Near-optimal clustering in the \(k\)-machine model
This page was built for publication: Algorithms - ESA 2003
