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

Tung-Wei Kuo

Browse the full Algosensors paper archive.