Super-Fast Distributed Algorithms for Metric Facility Location

DOI10.1007/978-3-642-31585-5_39zbMath1367.68338arXiv1308.2473OpenAlexW1866858131MaRDI QIDQ3167031

Andrew Berns, James W. Hegeman, Sriram V. Pemmaraju

Publication date: 1 November 2012

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.2473

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Distributed algorithms (68W15)

Related Items (5)

Lessons from the congested clique applied to MapReduce ⋮ (Delta+1) Coloring in the Congested Clique Model ⋮ Unnamed Item ⋮ Sub-logarithmic distributed algorithms for metric facility location ⋮ Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE

This page was built for publication: Super-Fast Distributed Algorithms for Metric Facility Location