Return of the primal-dual

DOI10.1145/1582716.1582747zbMath1291.90117OpenAlexW2090964330MaRDI QIDQ5170315

Saurav Pandit, Sriram V. Pemmaraju

Publication date: 23 July 2014

Published in: Proceedings of the 28th ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

facility locationapproximation algorithmswireless ad-hoc networksunit ball graphsbounded message size

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Distributed algorithms (68W15)

Related Items (5)

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 ⋮ 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: Return of the primal-dual