Lower bounds for local approximation

DOI10.1145/2332432.2332465zbMath1301.68147arXiv1201.6675MaRDI QIDQ2933794

Mika Göös, Jukka Suomela, Juho Hirvonen

Publication date: 5 December 2014

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

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

zbMATH Keywords

approximation algorithms; local algorithms; edge dominating set; unique identifiers; deterministic distributed algorithms

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

68W25: Approximation algorithms

68W15: Distributed algorithms