PTAS for Minimum Connected Dominating Set with Routing Cost Constraint in Wireless Sensor Networks

DOI10.1007/978-3-642-17458-2_21zbMath1311.90162OpenAlexW1593594285MaRDI QIDQ3066162

Haesun Park, Qiang Ye, Jioafei Zhong, Yuexuan Wang, Hongwei David Du, Won Jun Lee

Publication date: 8 January 2011

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17458-2_21

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

The wake up dominating set problem ⋮ A PTAS for Weak Minimum Routing Cost Connected Dominating Set of Unit Disk Graph

This page was built for publication: PTAS for Minimum Connected Dominating Set with Routing Cost Constraint in Wireless Sensor Networks