{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:35:17Z","timestamp":1725744917681},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642404498"},{"type":"electronic","value":"9783642404504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40450-4_60","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T03:22:47Z","timestamp":1376623367000},"page":"707-718","source":"Crossref","is-referenced-by-count":1,"title":["Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections"],"prefix":"10.1007","author":[{"given":"Jannik","family":"Matuschke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Bley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"M\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"60_CR1","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.orl.2004.05.005","volume":"33","author":"E. Althaus","year":"2005","unstructured":"Althaus, E., Funke, S., Har-Peled, S., K\u00f6nemann, J., Ramos, E.A., Skutella, M.: Approximating k-hop minimum-spanning trees. Operations Research Letters\u00a033(2), 115\u2013120 (2005)","journal-title":"Operations Research Letters"},{"issue":"6","key":"60_CR2","doi-asserted-by":"publisher","first-page":"2212","DOI":"10.1137\/070708901","volume":"39","author":"J. Byrka","year":"2010","unstructured":"Byrka, J., Aardal, K.: An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. SIAM Journal on Computing\u00a039(6), 2212\u20132231 (2010)","journal-title":"SIAM Journal on Computing"},{"key":"60_CR3","doi-asserted-by":"crossref","unstructured":"Byrka, J., Grandoni, F., Rothvo\u00df, T., Sanit\u00e0, L.: An improved LP-based approximation for Steiner tree. In: Proceedings of the 42nd ACM Symposium on Theory of Computing, pp. 583\u2013592 (2010)","DOI":"10.1145\/1806689.1806769"},{"issue":"1","key":"60_CR4","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/jagm.1999.1042","volume":"33","author":"M. Charikar","year":"1999","unstructured":"Charikar, M., Chekuri, C., Cheung, T.-Y., Dai, Z., Goel, A., Guha, S., Li, M.: Approximation algorithms for directed Steiner problems. Journal of Algorithms\u00a033(1), 73\u201391 (1999)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"60_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1287\/trsc.1120.0423","volume":"47","author":"T. Harks","year":"2013","unstructured":"Harks, T., K\u00f6nig, F.G., Matuschke, J.: Approximation algorithms for capacitated location routing. Transportation Science\u00a047(1), 3\u201322 (2013)","journal-title":"Transportation Science"},{"issue":"1","key":"60_CR6","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/moor.17.1.36","volume":"17","author":"R. Hassin","year":"1992","unstructured":"Hassin, R.: Approximation schemes for the restricted shortest path problem. Mathematics of Operations Research\u00a017(1), 36\u201342 (1992)","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"60_CR7","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/BF01581035","volume":"22","author":"D.S. Hochbaum","year":"1982","unstructured":"Hochbaum, D.S.: Heuristics for the fixed cost median problem. Mathematical Programming\u00a022(1), 148\u2013162 (1982)","journal-title":"Mathematical Programming"},{"issue":"4","key":"60_CR8","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1007\/s00224-006-1305-z","volume":"41","author":"S. Kapoor","year":"2007","unstructured":"Kapoor, S., Sarwat, M.: Bounded-diameter minimum-cost graph problems. Theory of Computing Systems\u00a041(4), 779\u2013794 (2007)","journal-title":"Theory of Computing Systems"},{"issue":"4","key":"60_CR9","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BF01294129","volume":"14","author":"S. Khuller","year":"1995","unstructured":"Khuller, S., Raghavachari, B., Young, N.: Balancing minimum spanning trees and shortest-path trees. Algorithmica\u00a014(4), 305\u2013321 (1995)","journal-title":"Algorithmica"},{"issue":"2","key":"60_CR10","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0166-218X(99)00111-0","volume":"93","author":"G. Kortsarz","year":"1999","unstructured":"Kortsarz, G., Peleg, D.: Approximating the weight of shallow Steiner trees. Discrete Applied Mathematics\u00a093(2), 265\u2013285 (1999)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"60_CR11","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1006\/jagm.1998.0930","volume":"28","author":"M.V. Marathe","year":"1998","unstructured":"Marathe, M.V., Ravi, R., Sundaram, R., Ravi, S.S., Rosenkrantz, D.J., Hunt, H.B.: Bicriteria network design problems. Journal of Algorithms\u00a028(1), 142\u2013171 (1998)","journal-title":"Journal of Algorithms"},{"issue":"4","key":"60_CR12","first-page":"50","volume":"4","author":"J. Ma\u00dfberg","year":"2008","unstructured":"Ma\u00dfberg, J., Vygen, J.: Approximation algorithms for a facility location problem with service capacities. ACM Transactions on Algorithms (TALG)\u00a04(4), 50 (2008)","journal-title":"ACM Transactions on Algorithms (TALG)"},{"issue":"1","key":"60_CR13","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1287\/opre.1050.0228","volume":"54","author":"R. Ravi","year":"2006","unstructured":"Ravi, R., Sinha, A.: Approximation algorithms for problems combining facility location and network design. Operations Research\u00a054(1), 73\u201381 (2006)","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40450-4_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T16:48:10Z","timestamp":1558025290000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40450-4_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404498","9783642404504"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40450-4_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}