{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:59:27Z","timestamp":1725893967437},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735557"},{"type":"electronic","value":"9783540735564"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73556-4_33","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T11:55:47Z","timestamp":1188302147000},"page":"311-322","source":"Crossref","is-referenced-by-count":2,"title":["Improved Approximation Algorithm for Connected Facility Location Problems"],"prefix":"10.1007","author":[{"given":"Mohammad Khairul","family":"Hasan","sequence":"first","affiliation":[]},{"given":"Hyunwoo","family":"Jung","sequence":"additional","affiliation":[]},{"given":"Kyung-Yong","family":"Chwa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1109\/SFCS.2000.892329","volume-title":"FOCS 2000: Proceedings of 41st Annual Symposiam on Foundations of Computer Science","author":"D.R. Karger","year":"2000","unstructured":"Karger, D.R., Minkoff, M.: Building steiner trees with incomplete global knowledge. In: FOCS 2000: Proceedings of 41st Annual Symposiam on Foundations of Computer Science, Washington, DC, USA, p. 613. IEEE Computer Society Press, Los Alamitos (2000)"},{"key":"33_CR2","first-page":"389","volume-title":"ACM Symposium on Theory of Computing","author":"A. Gupta","year":"2001","unstructured":"Gupta, A., Kleinberg, J.M., Kumar, A., Rastogi, R., Yener, B.: Provisioning a virtual private network: a network design problem for multicommodity flow. In: ACM Symposium on Theory of Computing, pp. 389\u2013398. ACM Press, New York (2001)"},{"key":"33_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-45753-4_22","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"C. Swamy","year":"2002","unstructured":"Swamy, C., Kumar, A.: Primal-dual algorithms for connected facility location problems. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol.\u00a02462, pp. 256\u2013269. Springer, Heidelberg (2002)"},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s00453-004-1112-3","volume":"40","author":"C. Swamy","year":"2004","unstructured":"Swamy, C., Kumar, A.: Primal-dual algorithms for connected facility location problems. Algorithmica,\u00a040, 245\u2013269 (2004)","journal-title":"Algorithmica,"},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1145\/780542.780597","volume-title":"STOC 2003: Proceedings of the thirty-fifth annual ACM symposium on Theory of Computing","author":"A. Gupta","year":"2003","unstructured":"Gupta, A., Kumar, A., Roughgarden, T.: Simpler and better approximation algorithms for network design. In: STOC 2003: Proceedings of the thirty-fifth annual ACM symposium on Theory of Computing, pp. 365\u2013372. ACM Press, New York, NY, USA (2003)"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Lin, J., Vitter, J.S.: \u03b5-approximations with minimum packing constraint violation. In: Proceedings of 24th STOC, pp. 771\u2013782 (1992)","DOI":"10.1145\/129712.129787"},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/258533.258600","volume-title":"STOC 1997: Proceedings of the twenty-ninth annual ACM symposium on Theory on Computing","author":"D.B. Shmoys","year":"1997","unstructured":"Shmoys, D.B., Tardos, \u00c9., Aardal, K.: Approximation algorithms for facility location problems (extended abstract). In: STOC 1997: Proceedings of the twenty-ninth annual ACM symposium on Theory on Computing, pp. 265\u2013274. ACM Press, New York (1997)"},{"key":"33_CR8","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 of Computing,\u00a024, 296\u2013317 (1995)","journal-title":"SIAM Journal of Computing,"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73556-4_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:16:18Z","timestamp":1605744978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73556-4_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735557","9783540735564"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73556-4_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}