The minimum connected dominating set problem: Formulation, valid inequalities and a branch-and-cut algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6701 LNCS, Issue , 2011, Pages 162-169

  Simonetti, Luidi ^a   Salles Da Cunha, Alexandre ^b   Lucena, Abilio ^c  

^a FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

^b FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

^c FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH-AND-CUT ALGORITHMS; COMPUTATIONAL RESULTS; DENSE GRAPHS; EXACT ALGORITHMS; INTEGER PROGRAMMING FORMULATIONS; LOWER BOUNDS; MINIMUM CONNECTED DOMINATING SET; SEPARATION ALGORITHMS; VALID INEQUALITY;

INTEGER PROGRAMMING; OPTIMIZATION; REINFORCEMENT;

ALGORITHMS; INTEGER PROGRAMMING;

EID: 80053034980     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21527-8_21     Document Type: Conference Paper

References (13)

1. Balasundaram, B., Butenko, S.: Graph domination, coloring and cliques in telecommunications. In: Handbook of Optimization in Telecommunications, pp. 865-890. Springer, Heidelberg (2006)
2. Borndörfer, R.: Aspects of Set Packing, Partitioning and Covering. Ph.D. thesis, Konrad-Zuse-Zentrum fur Informationstechnik, Berlin (1998)
3. Chen, S., Ljubić, I., Raghavan, S.: The regenerator location problem. Networks 55(3), 205-220 (2010)
4. Fujie, T.: The Maximum-leaf Spanning Tree Problem: formulations and facets. Networks 43(4), 212-223 (2004)
5. Fujie, T.: An exact algorithm for the Maximum-leaf Spanning Tree Problem. European Journal of Operational Research 104, 250-261 (2003)
6. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness (1979)
7. Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20(4), 374-387 (1998)
8. Kruskal, J.: On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. Proceedings of the American Mathematical Society 7, 48-50 (1956)
9. Lucena, A., Maculan, N., Simonetti, L.: Reformulation and solution algorithms for the maximum leaf spanning tree problem. Computational Management Science 7, 289-311 (2010)
10. Magnanti, T.L., Wolsey, L.: Optimal Trees. In: Ball, O., et al. (eds.) Handbooks in OR and MS, vol. 7, pp. 503-615. North-Holland, Amsterdam (1995)
11. Marathe, M.V., Breu, H., Hunt III, H.B., Ravi, S.S., Rosenkrantz, D.J.: Simple heuristics for unit disc graphs. Networks 25, 59-68 (1995)
12. Padberg, M.W., Rinaldi, G.: A Branch-and-Cut algorithm for resolution of large scale of Symmetric Traveling Salesman Problem. SIAM Review 33, 60-100 (1991)
13. Padberg, M.W., Wolsey, L.: Trees and cuts. Annals of Discrete Mathematics 17, 511-517 (1983)