A distributed approximation algorithm for the bottleneck connected dominating set problem

DOI10.1007/s11590-011-0314-2zbMath1259.90015OpenAlexW2090803007MaRDI QIDQ1926605

Anurag Verma, Sergiy I. Butenko

Publication date: 28 December 2012

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-011-0314-2

zbMATH Keywords

wireless networksdistributed algorithmbottleneck connected dominating set

Mathematics Subject Classification ID

Mixed integer programming (90C11) Communication networks in operations research (90B18)

Related Items (1)

The probabilistic and reliable connected power dominating set problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On connected domination in unit ball graphs
• Clustering to minimize the maximum intercluster distance
• Approximation algorithms for connected dominating sets
• Wireless networking, dominating and packing
• On approximation of dominating tree in wireless sensor networks
• Improving construction for connected dominating set with Steiner tree in wireless sensor networks
• Integer Programming Formulation of Traveling Salesman Problems
• Locality in Distributed Graph Algorithms

This page was built for publication: A distributed approximation algorithm for the bottleneck connected dominating set problem