On the Approximability and Hardness of the Minimum Connected Dominating Set with Routing Cost Constraint

Tung-Wei Kuo. On the Approximability and Hardness of the Minimum Connected Dominating Set with Routing Cost Constraint. In Seth Gilbert, Danny Hughes 0001, Bhaskar Krishnamachari, editors, Algorithms for Sensor Systems - 14th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers. Volume 11410 of Lecture Notes in Computer Science, pages 32-46, Springer, 2018. [doi]

Abstract

Abstract is missing.