{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:27:50Z","timestamp":1761611270120},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228493"},{"type":"electronic","value":"9783540278368"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_68","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T18:53:21Z","timestamp":1284576801000},"page":"805-818","source":"Crossref","is-referenced-by-count":7,"title":["Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design"],"prefix":"10.1007","author":[{"given":"Raja","family":"Jothi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Balaji","family":"Raghavachari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"68_CR1","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1287\/mnsc.34.3.331","volume":"34","author":"K. Altinkemer","year":"1988","unstructured":"Altinkemer, K., Gavish, B.: Heuristics with constant error guarantees for the design of tree networks. Management Science\u00a034, 331\u2013341 (1988)","journal-title":"Management Science"},{"key":"68_CR2","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1147\/sj.53.0142","volume":"5","author":"L.R. Esau","year":"1966","unstructured":"Esau, L.R., Williams, K.C.: On teleprocessing system design. IBM Sys. Journal\u00a05, 142\u2013147 (1966)","journal-title":"IBM Sys. Journal"},{"key":"68_CR3","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman, San Francisco (1979)"},{"key":"68_CR4","unstructured":"Gavish, B., Altinkemer, K.: Parallel savings heuristics for the topological design of local access tree networks. In: Proc. IEEE INFOCOM, pp. 130-139 (1986)"},{"key":"68_CR5","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"M. Goemans","year":"1995","unstructured":"Goemans, M., Williamson, D.: A General Approximation Technique for Constrained Forest Problems. SIAM J. on Comput.\u00a024, 296\u2013317 (1995)","journal-title":"SIAM J. on Comput."},{"key":"68_CR6","doi-asserted-by":"crossref","unstructured":"Hassin, R., Ravi, R., Salman, F.S.: Approximation algorithms for capacitated network design problems. In: APPROX, pp. 167\u2013176 (2000)","DOI":"10.1007\/3-540-44436-X_17"},{"key":"68_CR7","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF02293049","volume":"8","author":"C. Monma","year":"1992","unstructured":"Monma, C., Suri, S.: Transitions in geometric minimum spanning trees. Disc. Comput. Geom.\u00a08, 265\u2013293 (1992)","journal-title":"Disc. Comput. Geom."},{"key":"68_CR8","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/net.3230080306","volume":"8","author":"C.H. Papadimitriou","year":"1978","unstructured":"Papadimitriou, C.H.: The complexity of the capacitated tree problem. Networks\u00a08, 217\u2013230 (1978)","journal-title":"Networks"},{"key":"68_CR9","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF02570700","volume":"14","author":"G. Robins","year":"1995","unstructured":"Robins, G., Salowe, J.S.: Low-degree minimum spanning trees. Disc. Comput. Geom.\u00a014, 151\u2013166 (1995)","journal-title":"Disc. Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27836-8_68.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:31:04Z","timestamp":1619998264000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}