Routing-efficient CDS construction in disk-containment graphs

DOI10.1007/s11590-012-0590-5zbMath1293.90074OpenAlexW2045711969MaRDI QIDQ2448125

Lidong Wu, Ding-Zhu Du, Zaixin Lu, Panos M. Pardalos, Won Jun Lee, Eugene M. Maslov

Publication date: 30 April 2014

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

Full work available at URL: https://doi.org/10.1007/s11590-012-0590-5

zbMATH Keywords

approximation algorithmwireless networkCDSrouting efficiency

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18)

Related Items (1)

Symmetry properties of resolving sets and metric bases in hypercubes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum connected dominating sets and maximal independent sets in unit disk graphs
• Unit disk graphs
• Approximation algorithms for connected dominating sets
• Distributed dynamic channel access scheduling for ad hoc networks.
• On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs
• On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks
• A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks

This page was built for publication: Routing-efficient CDS construction in disk-containment graphs