{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:27:43Z","timestamp":1761611263624},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223399"},{"type":"electronic","value":"9783540278108"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27810-8_29","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T13:27:29Z","timestamp":1279027649000},"page":"336-348","source":"Crossref","is-referenced-by-count":21,"title":["Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems"],"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":"29_CR1","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y.: Buy-at-bulk network design. In: Proc. 38th IEEE Symp. on Foundations of Computer Science (FOCS), pp. 542\u2013547 (1997)","DOI":"10.1109\/SFCS.1997.646143"},{"key":"29_CR2","unstructured":"Bartal, Y.: Competitive analysis of distributed on-line problems-distributed paging. Ph.D. Dissertation, Tel-Aviv University, Israel (1994)"},{"key":"29_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/3-540-45535-3_14","volume-title":"Integer Programming and Combinatorial Optimization","author":"N. Garg","year":"2001","unstructured":"Garg, N., Khandekar, R., Konjevod, G., Ravi, R., Salman, F.S., Sinha, A.: On the integrality gap of a natural formulation of the single-sink buy-at-bulk network design problem. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol.\u00a02081, pp. 170\u2013184. Springer, Heidelberg (2001)"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Guha, S., Meyerson, A., Munagala, K.: A constant factor approximation for the single sink edge installation problems. In: Proc. 33rd ACM Symp. on Theory of Computing (STOC), pp. 383\u2013399 (2001)","DOI":"10.1145\/380752.380827"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Gupta, A., Kumar, A., Roughgarden, T.: Simpler and better approximation algorithms for network design. In: Proc. 35th ACM Symp. on Theory of Computing (STOC), pp. 365\u2013372 (2003)","DOI":"10.1145\/780542.780597"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Hassin, R., Ravi, R., Salman, F.S.: Approximation algorithms for capacitated network design problems. In: Proc. 3rd Intl. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pp. 167\u2013176 (2000)","DOI":"10.1007\/3-540-44436-X_17"},{"key":"29_CR7","unstructured":"Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. In: Proc. 11th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 770\u2013779 (2000)"},{"issue":"3","key":"29_CR8","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1137\/S1052623497321432","volume":"11","author":"F.S. Salman","year":"2000","unstructured":"Salman, F.S., Cheriyan, J., Ravi, R., Subramanian, S.: Approximating the singlesink link-installation problem in network design. SIAM J. on Optimization\u00a011(3), 595\u2013610 (2000)","journal-title":"SIAM J. on Optimization"},{"key":"29_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/3-540-47867-1_33","volume-title":"Integer Programming and Combinatorial Optimization","author":"K. Talwar","year":"2002","unstructured":"Talwar, K.: Single-sink buy-at-bulk LP has constant integrality gap. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol.\u00a02337, pp. 475\u2013486. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27810-8_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:27:10Z","timestamp":1619998030000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27810-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223399","9783540278108"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27810-8_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}