Quorum placement in networks

DOI10.1145/1146381.1146388zbMath1314.68377OpenAlexW2068136140MaRDI QIDQ5177260

Michael K. Reiter, Anupam Gupta, Bruce M. Maggs, Daniel Golovin, Florian Oprea

Publication date: 10 March 2015

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

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

zbMATH Keywords

approximation algorithmsquorum systemsLP roundingcongestion problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Approximation algorithms (68W25) Distributed algorithms (68W15)

Related Items (2)

Refined quorum systems ⋮ Minimum Congestion Mapping in a Cloud

This page was built for publication: Quorum placement in networks