Facility location

DOI10.1145/1073814.1073834zbMath1314.68386OpenAlexW2166590374MaRDI QIDQ5177232

Roger Wattenhofer, Thomas Moscibroda

Publication date: 10 March 2015

Published in: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1073814.1073834

zbMATH Keywords

linear programmingfacility locationprimal-dual algorithmsdistributed approximation

Mathematics Subject Classification ID

Continuous location (90B85) Linear programming (90C05) Graph theory (including graph drawing) in computer science (68R10) 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 (6)

Fast primal-dual distributed algorithms for scheduling and matching problems ⋮ Lessons from the congested clique applied to MapReduce ⋮ A distributed O(1)-approximation algorithm for the uniform facility location problem ⋮ Kinetic facility location ⋮ Sub-logarithmic distributed algorithms for metric facility location ⋮ Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree

This page was built for publication: Facility location