@inproceedings{403d8d47fa54434f88918ebeba3442a8,
title = "Solving the connected dominating set problem and power dominating set problem by integer programming",
abstract = "In this paper, we propose several integer programming approaches with a polynomial number of constraints to formulate and solve the minimum connected dominating set problem. Further, we consider both the power dominating set problem - a special dominating set problem for sensor placement in power systems - and its connected version. We propose formulations and algorithms to solve these integer programs, and report results for several power system graphs.",
keywords = "Connected Dominating Set Problem, Connected Subgraph, Integer Programming, Power Dominating Set Problem, Spanning Tree",
author = "Neng Fan and Watson, {Jean Paul}",
year = "2012",
doi = "10.1007/978-3-642-31770-5_33",
language = "English (US)",
isbn = "9783642317699",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "371--383",
booktitle = "Combinatorial Optimization and Applications - 6th International Conference, COCOA 2012, Proceedings",
note = "6th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2012 ; Conference date: 05-08-2012 Through 09-08-2012",
}