Luidi Simonetti, Alexandre Salles da Cunha, Abilio Lucena. The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm. In Julia Pahl, Torsten Reiners, Stefan Voß, editors, Network Optimization - 5th International Conference, INOC 2011, Hamburg, Germany, June 13-16, 2011. Proceedings. Volume 6701 of Lecture Notes in Computer Science, pages 162-169, Springer, 2011. [doi]
@inproceedings{SimonettiCL11, title = {The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm}, author = {Luidi Simonetti and Alexandre Salles da Cunha and Abilio Lucena}, year = {2011}, doi = {10.1007/978-3-642-21527-8_21}, url = {http://dx.doi.org/10.1007/978-3-642-21527-8_21}, researchr = {https://researchr.org/publication/SimonettiCL11}, cites = {0}, citedby = {0}, pages = {162-169}, booktitle = {Network Optimization - 5th International Conference, INOC 2011, Hamburg, Germany, June 13-16, 2011. Proceedings}, editor = {Julia Pahl and Torsten Reiners and Stefan Voß}, volume = {6701}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-21526-1}, }