{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:51:25Z","timestamp":1725486685422},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679967"},{"type":"electronic","value":"9783540444367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44436-x_17","type":"book-chapter","created":{"date-parts":[[2007,6,18]],"date-time":"2007-06-18T05:33:14Z","timestamp":1182144794000},"page":"167-176","source":"Crossref","is-referenced-by-count":13,"title":["Approximation Algorithms for a Capacitated Network Design Problem"],"prefix":"10.1007","author":[{"given":"R.","family":"Hassin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Ravi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F. S.","family":"Salman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,3]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1287\/mnsc.34.3.331","volume":"34","author":"K. Altinkemer","year":"1988","unstructured":"K. Altinkemer and B. Gavish, \u201cHeuristics with constant error guarantees for the design of tree networks,\u201d Management Science, 34, (1988) 331\u2013341","journal-title":"Management Science"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"M. Andrews and L. Zhang, \u201cThe access network design problem,\u201d In Proc. of the 39th Ann. IEEE Symp. on Foundations of Computer Science, (1998) 42\u201349","DOI":"10.1109\/SFCS.1998.743427"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1002\/net.3230030204","volume":"3","author":"K. M. Chandy","year":"1973","unstructured":"K. M. Chandy and T. Lo, \u201cThe capacitated minimum tree,\u201d Networks, 3, (1973) 173\u2013182","journal-title":"Networks"},{"key":"17_CR4","unstructured":"Kawatra, R. and D. L. Bricker, \u201cA multiperiod planning model for the capacitated minimal spanning tree problem\u201d, to appear in European Journal of Operational Research (1998)"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1002\/net.3230130211","volume":"13","author":"A. Kershenbaumand","year":"1983","unstructured":"A. Kershenbaumand R. Boorstyn, \u201cCentralized teleprocessing network design,\u201d Networks, 13, (1983) 279\u2013293","journal-title":"Networks"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BF01294129","volume":"14","author":"S. Khuller","year":"1993","unstructured":"S. Khuller, B. Raghavachari and N. E. Young, \u201cBalancing minimum spanning and shortest path trees,\u201d Algorithmica, 14, (1993) 305\u2013322","journal-title":"Algorithmica"},{"key":"17_CR7","unstructured":"Y. Mansour and D. Peleg, \u201cAn approximation algorithm for minimum-cost network design,\u201d The Weizman Institute of Science, Rehovot, 76100 Israel, Tech. Report CS94-22, 1994; Also presented at the DIMACS workshop on Robust Communication Networks, 1998."},{"key":"17_CR8","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/net.3230080306","volume":"8","author":"C. H. Papadimitriou","year":"1978","unstructured":"C. H. Papadimitriou, \u201cThe complexity of the capacitated tree problem,\u201d Networks, 8, (1978) 217\u2013230","journal-title":"Networks"},{"key":"17_CR9","unstructured":"G. Robins and A. Zelikovsky, \u201cImproved steiner tree approximation in graphs\u201d, Proc. of the 10th Ann. ACM-SIAM Symp. on Discrete Algorithms, (2000) 770\u2013779"},{"key":"17_CR10","unstructured":"F.S. Salman, J. Cheriyan, R. Ravi and S. Subramanian, \u201cBuy-at-bulk network design: Approximating the single-sink edge installation problem,\u201d Proc. of the 8th Ann. ACM-SIAM Symposium on Discrete Algorithms, (1997) 619\u2013628"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1109\/TCOM.1983.1095845","volume":"31","author":"R. L. Sharma","year":"1983","unstructured":"R. L. Sharma, \u201cDesign of an economical multidrop network topology with capacity constraints,\u201d IEEE Trans. Comm., 31, (1983) 590\u2013591","journal-title":"IEEE Trans. Comm."},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"B. Sanso and P. Soriano, Editors, \u201cTelecommunications Network Planning,\u201d Kluwer Academic Publishers, 1999.","DOI":"10.1007\/978-1-4615-5087-7"}],"container-title":["Lecture Notes in Computer Science","Approximation Algorithms for Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44436-X_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T05:01:08Z","timestamp":1550379668000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44436-X_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679967","9783540444367"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-44436-x_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}