{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T19:16:11Z","timestamp":1794424571888,"version":"4.9.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642315930","type":"print"},{"value":"9783642315947","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31594-7_14","type":"book-chapter","created":{"date-parts":[[2012,6,22]],"date-time":"2012-06-22T17:20:21Z","timestamp":1340385621000},"page":"157-169","source":"Crossref","is-referenced-by-count":9,"title":["Improved LP-Rounding Approximation Algorithm for k-level Uncapacitated Facility Location"],"prefix":"10.1007","author":[{"given":"Jaroslaw","family":"Byrka","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bartosz","family":"Rybicki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"5-6","key":"14_CR1","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0020-0190(99)00144-1","volume":"72","author":"K. Aardal","year":"1999","unstructured":"Aardal, K., Chudak, F., Shmoys, D.: A 3-Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem. Inf. Process. Lett.\u00a072(5-6), 161\u2013167 (1999)","journal-title":"Inf. Process. Lett."},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Aardal, K., Tardos, E., Shmoys, D.: Approximation Algorithms for Facility Location Problems (Extended Abstract). In: STOC 1997, pp. 265\u2013274 (1997)","DOI":"10.1145\/258533.258600"},{"issue":"1","key":"14_CR3","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1137\/S0895480102417215","volume":"18","author":"A. Ageev","year":"2004","unstructured":"Ageev, A., Ye, Y., Zhang, J.: Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem. SIAM J. Discrete Math.\u00a018(1), 207\u2013217 (2004)","journal-title":"SIAM J. Discrete Math."},{"issue":"6","key":"14_CR4","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 J. Comput.\u00a039(6), 2212\u20132231 (2010)","journal-title":"SIAM J. Comput."},{"key":"14_CR5","unstructured":"Byrka, J., Ghodsi, M., Srinivasan, A.: LP-rounding algorithms for facility-location problems CoRR, abs\/1007.3611 (2010)"},{"issue":"1","key":"14_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539703405754","volume":"33","author":"F. Chudak","year":"2003","unstructured":"Chudak, F., Shmoys, D.: Improved Approximation Algorithms for the Uncapacitated Facility Location Problem. SIAM J. Comput.\u00a033(1), 1\u201325 (2003)","journal-title":"SIAM J. Comput."},{"key":"14_CR7","unstructured":"Garg, N., Konjevod, G., Ravi, R.: A polylogarithmic approximation algorithm for the group Steiner tree problem. In: SODA 1998, pp. 253\u2013259 (1998)"},{"key":"14_CR8","unstructured":"Guha, S., Khuller, S.: Greedy strikes back: Improved facility location algorithms"},{"key":"#cr-split#-14_CR9.1","doi-asserted-by":"crossref","unstructured":"Krishnaswamy, R., Sviridenko, M.: Inapproximability of the multi-level uncapacitated facility location problem. SODA 2012\u00a031(1), 718-734 (1999)","DOI":"10.1137\/1.9781611973099.59"},{"key":"#cr-split#-14_CR9.2","doi-asserted-by":"crossref","unstructured":"Journal of Algorithms 31(1), 228-248 (1999)","DOI":"10.1006\/jagm.1998.0993"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-22012-8_5","volume-title":"Automata, Languages and Programming","author":"S. Li","year":"2011","unstructured":"Li, S.: A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 77\u201388. Springer, Heidelberg (2011)"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/3-540-47867-1_18","volume-title":"Integer Programming and Combinatorial Optimization","author":"M. Sviridenko","year":"2002","unstructured":"Sviridenko, M.: An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol.\u00a02337, pp. 240\u2013257. Springer, Heidelberg (2002)"},{"key":"14_CR12","unstructured":"Zhang, J.: Approximating the two-level facility location problem via a quasi-greedy approach. In: SODA 2004, pp. 808\u2013817 (2004)"}],"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-642-31594-7_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T08:11:53Z","timestamp":1743581513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31594-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642315930","9783642315947"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31594-7_14","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-31594-7","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}