On the locality of bounded growth
DOI10.1145/1073814.1073826zbMath1314.68160OpenAlexW2114986147MaRDI QIDQ5177224
Roger Wattenhofer, Fabian Kuhn, 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.1073826
coveringpackinglocalitydistributed algorithmsdoubling dimensionmaximal independent setdominating setsnetwork decompositionbounded growthunit disk graphs
Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Network design and communication in computer systems (68M10) 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) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distributed algorithms (68W15)
Related Items