{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:14:36Z","timestamp":1725542076194},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642106309"},{"type":"electronic","value":"9783642106316"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10631-6_90","type":"book-chapter","created":{"date-parts":[[2009,12,4]],"date-time":"2009-12-04T07:03:43Z","timestamp":1259910223000},"page":"892-901","source":"Crossref","is-referenced-by-count":1,"title":["Covering a Graph with a Constrained Forest (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Cristina","family":"Bazgan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Basile","family":"Cou\u00ebtoux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zsolt","family":"Tuza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"90_CR1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B.S. Baker","year":"1994","unstructured":"Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. Journal of the Association for Computing Machinery\u00a041(1), 153\u2013180 (1994)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"90_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H.L. Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science\u00a0209, 1\u201345 (1998)","journal-title":"Theoretical Computer Science"},{"key":"90_CR3","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/j.tcs.2005.11.029","volume":"354","author":"M. Chlebik","year":"2006","unstructured":"Chlebik, M., Clebikova, J.: Complexity of approximating bounded variants of optimization problems. Theoretical Computer Science\u00a0354, 320\u2013338 (2006)","journal-title":"Theoretical Computer Science"},{"key":"90_CR4","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1051\/ita\/1992260302571","volume":"26","author":"B. Courcelle","year":"1992","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. III. Tree-decompositions, minors and complexity issues. RAIRO Informatique Th\u00e9orique Appliqu\u00e9e\u00a026, 257\u2013266 (1992)","journal-title":"RAIRO Informatique Th\u00e9orique Appliqu\u00e9e"},{"key":"90_CR5","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/0196-6774(86)90002-7","volume":"7","author":"M.E. Dyer","year":"1986","unstructured":"Dyer, M.E., Frieze, A.M.: Planar 3DM is NP-complete. Journal of Algorithms\u00a07, 174\u2013184 (1986)","journal-title":"Journal of Algorithms"},{"key":"90_CR6","doi-asserted-by":"crossref","unstructured":"Dorn, F., Penninkx, E., Bodlaender, H.L., Fomin, F.: Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions. Technical Report UU-CS-2006-006","DOI":"10.1007\/11561071_11"},{"key":"90_CR7","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J. Edmonds","year":"1973","unstructured":"Edmonds, J., Johnson, E.L.: Matching, Euler tours and the Chinese postman. Mathematical Programming\u00a05, 88\u2013124 (1973)","journal-title":"Mathematical Programming"},{"key":"90_CR8","first-page":"133","volume":"2","author":"T. Gallai","year":"1959","unstructured":"Gallai, T.: \u00dcber extreme Punkt- und Kantenmengen. Annales Universitatis Scientiarum Budapestinensis de Rolando E\u00f6tv\u00f6s Nominatae. Sectio Mathematica\u00a02, 133\u2013138 (1959)","journal-title":"Sectio Mathematica"},{"key":"90_CR9","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. SIAM Journal of Computing\u00a024, 296\u2013317 (1995)","journal-title":"SIAM Journal of Computing"},{"key":"90_CR10","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0167-6377(93)90097-Z","volume":"14","author":"C. Imielinska","year":"1993","unstructured":"Imielinska, C., Kalantari, B., Khachiyan, L.: A greedy heristic for a minmum-weight forest problem. Operations Research Letters\u00a014, 65\u201371 (1993)","journal-title":"Operations Research Letters"},{"key":"90_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Treewidth","year":"1994","unstructured":"Kloks, T. (ed.): Treewidth. LNCS, vol.\u00a0842. Springer, Heidelberg (1994)"},{"key":"90_CR12","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/j.orl.2004.11.010","volume":"33","author":"M. Laszlo","year":"2005","unstructured":"Laszlo, M., Mukherjee, S.: Another greedy heuristic for the constrained forest problem. Operations Research Letters\u00a033, 629\u2013633 (2005)","journal-title":"Operations Research Letters"},{"key":"90_CR13","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/j.dam.2005.06.006","volume":"154","author":"M. Laszlo","year":"2006","unstructured":"Laszlo, M., Mukherjee, S.: A class of heuristics for the constrained forest problem. Discrete Applied Mathematics\u00a0154, 6\u201314 (2006)","journal-title":"Discrete Applied Mathematics"},{"key":"90_CR14","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1016\/j.orl.2006.12.004","volume":"35","author":"J. Monnot","year":"2007","unstructured":"Monnot, J., Toulouse, S.: The path partition problem and related problems in bipartite graphs. Operations Research Letters\u00a035, 677\u2013684 (2007)","journal-title":"Operations Research Letters"},{"key":"90_CR15","volume-title":"Combinatorial Optimization","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization. Springer, Heidelberg (2003)"},{"key":"90_CR16","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(91)90094-Z","volume":"52","author":"Z. Tuza","year":"1991","unstructured":"Tuza, Z.: Extensions of Gallai\u2019s graph covering theorems for uniform hypergraphs. Journal of Combinatorial Theory Series\u00a0B\u00a052, 92\u201396 (1991)","journal-title":"Journal of Combinatorial Theory Series\u00a0B"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10631-6_90.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:32:28Z","timestamp":1606185148000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10631-6_90"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642106309","9783642106316"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10631-6_90","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}