{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:34:14Z","timestamp":1725701654526},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642330896"},{"type":"electronic","value":"9783642330902"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33090-2_33","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T15:29:11Z","timestamp":1346167751000},"page":"373-382","source":"Crossref","is-referenced-by-count":1,"title":["A Dual-Fitting $\\frac{3}{2}$ -Approximation Algorithm for Some Minimum-Cost Graph Problems"],"prefix":"10.1007","author":[{"given":"James M.","family":"Davis","sequence":"first","affiliation":[]},{"given":"David P.","family":"Williamson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"publisher","first-page":"4081","DOI":"10.1016\/j.tcs.2010.07.018","volume":"412","author":"C. Bazgan","year":"2011","unstructured":"Bazgan, C., Cou\u00ebtoux, B., Tuza, Z.: Complexity and approximation of the Constrained Forest problem. Theoretical Computer Science\u00a0412, 4081\u20134091 (2011)","journal-title":"Theoretical Computer Science"},{"key":"33_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1007\/978-3-642-23719-5_55","volume-title":"Algorithms \u2013 ESA 2011","author":"B. Cou\u00ebtoux","year":"2011","unstructured":"Cou\u00ebtoux, B.: A \n                  \n                    \n                  \n                  $\\frac{3}{2}$\n                 Approximation for a Constrained Forest Problem. In: Demetrescu, C., Halld\u00f3rsson, M.M. (eds.) ESA 2011. LNCS, vol.\u00a06942, pp. 652\u2013663. Springer, Heidelberg (2011)"},{"key":"33_CR3","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0167-6377(94)90067-1","volume":"16","author":"M.X. Goemans","year":"1994","unstructured":"Goemans, M.X., Williamson, D.P.: Approximating minimum-cost graph problems with spanning tree edges. Operations Research Letters\u00a016, 183\u2013189 (1994)","journal-title":"Operations Research Letters"},{"key":"33_CR4","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 on Computing\u00a024, 296\u2013317 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"33_CR5","volume-title":"Approximation Algorithms for NP-hard Problems","author":"M.X. Goemans","year":"1996","unstructured":"Goemans, M.X., Williamson, D.P.: The primal-dual method for approximation algorithms and its application to network design problems. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-hard Problems, ch.\u00a04. PWS Publishing, Boston (1996)"},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0167-6377(93)90097-Z","volume":"14","author":"C. Imieli\u0144ska","year":"1993","unstructured":"Imieli\u0144ska, C., Kalantari, B., Khachiyan, L.: A greedy heuristic for a minimum-weight forest problem. Operations Research Letters\u00a014, 65\u201371 (1993)","journal-title":"Operations Research Letters"},{"key":"33_CR7","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":"33_CR8","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":"33_CR9","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":"33_CR10","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s11590-007-0051-8","volume":"2","author":"M. Laszlo","year":"2008","unstructured":"Laszlo, M., Mukherjee, S.: An approximation algorithm for network design problems with downwards-monotone demand functions. Optimization Letters\u00a02, 171\u2013175 (2008)","journal-title":"Optimization Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33090-2_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:54:54Z","timestamp":1620129294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33090-2_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330896","9783642330902"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33090-2_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}