{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:52:03Z","timestamp":1725605523537},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642215261"},{"type":"electronic","value":"9783642215278"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21527-8_21","type":"book-chapter","created":{"date-parts":[[2011,9,8]],"date-time":"2011-09-08T11:01:16Z","timestamp":1315479676000},"page":"162-169","source":"Crossref","is-referenced-by-count":19,"title":["The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm"],"prefix":"10.1007","author":[{"given":"Luidi","family":"Simonetti","sequence":"first","affiliation":[]},{"given":"Alexandre","family":"Salles da Cunha","sequence":"additional","affiliation":[]},{"given":"Abilio","family":"Lucena","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1007\/978-0-387-30165-5_30","volume-title":"Handbook of Optimization in Telecommunications","author":"B. Balasundaram","year":"2006","unstructured":"Balasundaram, B., Butenko, S.: Graph domination, coloring and cliques in telecommunications. In: Handbook of Optimization in Telecommunications, pp. 865\u2013890. Springer, Heidelberg (2006)"},{"key":"21_CR2","unstructured":"Bornd\u00f6rfer, R.: Aspects of Set Packing, Partitioning and Covering. Ph.D. thesis, Konrad-Zuse-Zentrum fur Informationstechnik, Berlin (1998)"},{"issue":"3","key":"21_CR3","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/net.20366","volume":"55","author":"S. Chen","year":"2010","unstructured":"Chen, S., Ljubi\u0107, I., Raghavan, S.: The regenerator location problem. Networks\u00a055(3), 205\u2013220 (2010)","journal-title":"Networks"},{"issue":"4","key":"21_CR4","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1002\/net.20001","volume":"43","author":"T. Fujie","year":"2004","unstructured":"Fujie, T.: The Maximum-leaf Spanning Tree Problem: formulations and facets. Networks\u00a043(4), 212\u2013223 (2004)","journal-title":"Networks"},{"key":"21_CR5","first-page":"250","volume":"104","author":"T. Fujie","year":"2003","unstructured":"Fujie, T.: An exact algorithm for the Maximum-leaf Spanning Tree Problem. European Journal of Operational Research\u00a0104, 250\u2013261 (2003)","journal-title":"European Journal of Operational Research"},{"key":"21_CR6","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness (1979)"},{"issue":"4","key":"21_CR7","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S. Guha","year":"1998","unstructured":"Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica\u00a020(4), 374\u2013387 (1998)","journal-title":"Algorithmica"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J. Kruskal","year":"1956","unstructured":"Kruskal, J.: On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. Proceedings of the American Mathematical Society\u00a07, 48\u201350 (1956)","journal-title":"Proceedings of the American Mathematical Society"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s10287-009-0116-5","volume":"7","author":"A. Lucena","year":"2010","unstructured":"Lucena, A., Maculan, N., Simonetti, L.: Reformulation and solution algorithms for the maximum leaf spanning tree problem. Computational Management Science\u00a07, 289\u2013311 (2010)","journal-title":"Computational Management Science"},{"key":"21_CR10","first-page":"503","volume-title":"Handbooks in OR and MS","author":"T.L. Magnanti","year":"1995","unstructured":"Magnanti, T.L., Wolsey, L.: Optimal Trees. In: Ball, O., et al. (eds.) Handbooks in OR and MS, vol.\u00a07, pp. 503\u2013615. North-Holland, Amsterdam (1995)"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/net.3230250205","volume":"25","author":"M.V. Marathe","year":"1995","unstructured":"Marathe, M.V., Breu, H., Hunt III, H.B., Ravi, S.S., Rosenkrantz, D.J.: Simple heuristics for unit disc graphs. Networks\u00a025, 59\u201368 (1995)","journal-title":"Networks"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M.W. Padberg","year":"1991","unstructured":"Padberg, M.W., Rinaldi, G.: A Branch-and-Cut algorithm for resolution of large scale of Symmetric Traveling Salesman Problem. SIAM Review\u00a033, 60\u2013100 (1991)","journal-title":"SIAM Review"},{"key":"21_CR13","first-page":"511","volume":"17","author":"M.W. Padberg","year":"1983","unstructured":"Padberg, M.W., Wolsey, L.: Trees and cuts. Annals of Discrete Mathematics\u00a017, 511\u2013517 (1983)","journal-title":"Annals of Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Network Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21527-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,11]],"date-time":"2024-04-11T04:25:48Z","timestamp":1712809548000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21527-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642215261","9783642215278"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21527-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}