Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set
From MaRDI portal
Publication:5167862
DOI10.1007/978-3-662-43951-7_41zbMath1411.68048arXiv1404.7559OpenAlexW1587504556MaRDI QIDQ5167862
Publication date: 1 July 2014
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.7559
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25) Distributed algorithms (68W15)
Related Items (2)
This page was built for publication: Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set