Formulations for the Minimum 2-Connected Dominating Set Problem

Electronic Notes in Discrete Mathematics

Volumn 41, Issue , 2013, Pages 415-422

  do Forte, Vinicius Leal ^a   Lucena, Abilio ^a   Maculan, Nelson ^a  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

2 connected graphs; Branch and cut algorithms; Dominating sets

Indexed keywords

EID: 84879729055     PISSN: None     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2013.05.120     Document Type: Article

References (7)

1. Balasundaram B., Butenko S. Graph domination, coloring and cliques in telecommunications. Handbook of Optimization in Telecommunications 2006, 865-890. Springer.
2. Chen S., Ljubić I., Raghavan S. The regenerator location problem. Networks 2010, 55(3):205-220.
3. Diestel Reinhard Graph Theory 2010, Springer. 4 edition.
4. Grötschel M., Monma C.L., Stoer M. Design of survivable networks. Handbook in Operations Research and Management Science 1995, vol. 7:617-671. North Holland. M.O. Ball, C.L. Monma, G. Nemhauser (Eds.).
5. Liang X., Sencun Z. A Feasibility Study on Defending Against Ultra-Fast Topological Worms. Proceedings of The Seventh IEEE International Conference on Peer-to-Peer Computing (P2P'07) 2007.
6. Milenković T., Memišević V., Bonato A., Pržulj N. Dominating Biological Networks. PLoS ONE 2011, 6(8).
7. Simonetti L., da Cunha A.S., Lucena A. The minimum connected dominating set problem: Formulation, valid inequalities and a branch-and-cut algorithm. Lecture Notes in Computer Science 2011, vol. 6701:162-169. Springer. J. Pahl, T. Reiners, S. Voß (Eds.).