{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:21:07Z","timestamp":1725603667669},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237188"},{"type":"electronic","value":"9783642237195"}],"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-23719-5_55","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T09:14:33Z","timestamp":1314695673000},"page":"652-663","source":"Crossref","is-referenced-by-count":3,"title":["A $\\frac{3}{2}$ Approximation for a Constrained Forest Problem"],"prefix":"10.1007","author":[{"given":"Basile","family":"Cou\u00ebtoux","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"55_CR1","doi-asserted-by":"crossref","unstructured":"Bazgan, C., Cou\u00ebtoux, B., Tuza, Z.: Complexity and approximation of the constrained forest problem. Theoretical Computer Science (to appear, 2011)","DOI":"10.1016\/j.tcs.2010.07.018"},{"issue":"24","key":"55_CR2","first-page":"296","volume":"1","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. Society for Industrial and Applied Mathematics\u00a01(24), 296\u2013317 (1995)","journal-title":"Society for Industrial and Applied Mathematics"},{"issue":"1-3","key":"55_CR3","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0166-218X(98)00052-3","volume":"87","author":"N. Guttmann-Beck","year":"1998","unstructured":"Guttmann-Beck, N., Hassin, R.: Approximation algorithms for minimum tree partition. Discrete Applied Mathematics\u00a087(1-3), 117\u2013137 (1998)","journal-title":"Discrete Applied Mathematics"},{"issue":"14","key":"55_CR4","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0167-6377(93)90097-Z","volume":"1","author":"C. Imielinska","year":"1993","unstructured":"Imielinska, C., Kalantari, B., Khachiyan, L.: A greedy heristic for a minmum-weight forest problem. Operations Research Letters\u00a01(14), 65\u201371 (1993)","journal-title":"Operations Research Letters"},{"issue":"33","key":"55_CR5","first-page":"629","volume":"1","author":"M. Laszlo","year":"2005","unstructured":"Laszlo, M., Mukherjee, S.: Another greedy heuristic for the constrained forest problem. Mathematical Programming\u00a01(33), 629\u2013633 (2005)","journal-title":"Mathematical Programming"},{"issue":"154","key":"55_CR6","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/j.dam.2005.06.006","volume":"1","author":"M. Laszlo","year":"2006","unstructured":"Laszlo, M., Mukherjee, S.: A class of heuristics for the constrained forest problem. Discrete Applied Mathematics\u00a01(154), 6\u201314 (2006)","journal-title":"Discrete Applied Mathematics"},{"issue":"35","key":"55_CR7","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1016\/j.orl.2006.12.004","volume":"1","author":"J. Monnot","year":"2007","unstructured":"Monnot, J., Toulouse, S.: The path partition problem and related problems in bipartite graphs. Operations Research Letters\u00a01(35), 677\u2013684 (2007)","journal-title":"Operations Research Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23719-5_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T11:29:32Z","timestamp":1554118172000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}