Automata, Languages and Programming

DOI10.1007/11523468zbMath1084.90027OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716835

Christian Sohler, Mihai Bădoiu, Artur Czumaj, Piotr Indyk

Publication date: 10 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11523468

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (12)

Separating sublinear time computations by approximate diameter ⋮ A concentration inequality for the facility location problem ⋮ Approximating average parameters of graphs ⋮ Unnamed Item ⋮ Facility Location in Dynamic Geometric Data Streams ⋮ A distributed O(1)-approximation algorithm for the uniform facility location problem ⋮ Small space representations for metric min-sum \(k\)-clustering and their applications ⋮ Kinetic facility location ⋮ Sublinear-time Algorithms ⋮ Sub-logarithmic distributed algorithms for metric facility location ⋮ A sublinear-time approximation scheme for bin packing ⋮ Separating Sublinear Time Computations by Approximate Diameter

This page was built for publication: Automata, Languages and Programming