{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T15:59:09Z","timestamp":1725465549786},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642382321"},{"type":"electronic","value":"9783642382338"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38233-8_31","type":"book-chapter","created":{"date-parts":[[2013,5,15]],"date-time":"2013-05-15T08:57:16Z","timestamp":1368608236000},"page":"370-381","source":"Crossref","is-referenced-by-count":3,"title":["LP-Rounding Algorithms for the Fault-Tolerant Facility Placement Problem"],"prefix":"10.1007","author":[{"given":"Li","family":"Yan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Chrobak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"31_CR1","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1137\/S0097539702416402","volume":"33","author":"V. Arya","year":"2004","unstructured":"Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristics for k-median and facility location problems. SIAM J. Comput.\u00a033(3), 544\u2013562 (2004)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"31_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 J. Comput.\u00a039(6), 2212\u20132231 (2010)","journal-title":"SIAM J. Comput."},{"key":"31_CR3","unstructured":"Byrka, J., Ghodsi, M.R., Srinivasan, A.: LP-rounding algorithms for facility-location problems. CoRR\u00a0abs\/1007.3611(2010)"},{"key":"31_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-13036-6_19","volume-title":"Integer Programming and Combinatorial Optimization","author":"J. Byrka","year":"2010","unstructured":"Byrka, J., Srinivasan, A., Swamy, C.: Fault-tolerant facility location: A randomized dependent LP-rounding algorithm. In: Eisenbrand, F., Shepherd, F.B. (eds.) IPCO 2010. LNCS, vol.\u00a06080, pp. 244\u2013257. Springer, Heidelberg (2010)"},{"issue":"1","key":"31_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539703405754","volume":"33","author":"F. Chudak","year":"2004","unstructured":"Chudak, F., Shmoys, D.: Improved approximation algorithms for the uncapacitated facility location problem. SIAM J. Comput.\u00a033(1), 1\u201325 (2004)","journal-title":"SIAM J. Comput."},{"key":"31_CR6","unstructured":"Guha, S., Khuller, S.: Greedy strikes back: improved facility location algorithms. In: Proc. 9th SODA, pp. 649\u2013657 (1998)"},{"issue":"2","key":"31_CR7","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/S0196-6774(03)00056-7","volume":"48","author":"S. Guha","year":"2003","unstructured":"Guha, S., Meyerson, A., Munagala, K.: A constant factor approximation algorithm for the fault-tolerant facility location problem. J. Algorithms\u00a048(2), 429\u2013440 (2003)","journal-title":"J. Algorithms"},{"key":"31_CR8","unstructured":"Gupta, A.: Lecture notes: CMU 15-854b (Spring 2008)"},{"issue":"6","key":"31_CR9","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1145\/950620.950621","volume":"50","author":"K. Jain","year":"2003","unstructured":"Jain, K., Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J. ACM\u00a050(6), 795\u2013824 (2003)","journal-title":"J. ACM"},{"issue":"2","key":"31_CR10","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1145\/375827.375845","volume":"48","author":"K. Jain","year":"2001","unstructured":"Jain, K., Vazirani, V.: Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. J. ACM\u00a048(2), 274\u2013296 (2001)","journal-title":"J. ACM"},{"issue":"3","key":"31_CR11","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s00453-003-1070-1","volume":"38","author":"K. Jain","year":"2003","unstructured":"Jain, K., Vazirani, V.: An approximation algorithm for the fault tolerant metric facility location problem. Algorithmica\u00a038(3), 433\u2013439 (2003)","journal-title":"Algorithmica"},{"key":"31_CR12","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":"31_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/978-3-642-22685-4_48","volume-title":"Computing and Combinatorics","author":"K. Liao","year":"2011","unstructured":"Liao, K., Shen, H.: Unconstrained and constrained fault-tolerant resource allocation. In: Fu, B., Du, D.-Z. (eds.) COCOON 2011. LNCS, vol.\u00a06842, pp. 555\u2013566. Springer, Heidelberg (2011)"},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Shmoys, D., Tardos, E., Aardal, K.: Approximation algorithms for facility location problems (extended abstract). In: Proc. 29th STOC, pp. 265\u2013274 (1997)","DOI":"10.1145\/258533.258600"},{"key":"31_CR15","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.I. Sviridenko","year":"2002","unstructured":"Sviridenko, M.I.: 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)"},{"issue":"4","key":"31_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1383369.1383382","volume":"4","author":"C. Swamy","year":"2008","unstructured":"Swamy, C., Shmoys, D.: Fault-tolerant facility location. ACM Trans. Algorithms\u00a04(4), 1\u201327 (2008)","journal-title":"ACM Trans. Algorithms"},{"key":"31_CR17","unstructured":"Vygen, J.: Approximation Algorithms for Facility Location Problems. Forschungsinst. f\u00fcr Diskrete Mathematik (2005)"},{"key":"31_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/978-3-642-10631-6_70","volume-title":"Algorithms and Computation","author":"S. Xu","year":"2009","unstructured":"Xu, S., Shen, H.: The fault-tolerant facility allocation problem. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 689\u2013698. Springer, Heidelberg (2009)"},{"issue":"11","key":"31_CR19","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1016\/j.ipl.2011.03.005","volume":"111","author":"L. Yan","year":"2011","unstructured":"Yan, L., Chrobak, M.: Approximation algorithms for the fault-tolerant facility placement problem. Inf. Process. Lett.\u00a0111(11), 545\u2013549 (2011)","journal-title":"Inf. Process. Lett."},{"key":"31_CR20","doi-asserted-by":"crossref","unstructured":"Yan, L., Chrobak, M.: LP-rounding Algorithms for the Fault-Tolerant Facility Placement Problem. CoRR\u00a0abs\/1205.1281 (2012)","DOI":"10.1007\/978-3-642-38233-8_31"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38233-8_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T10:15:33Z","timestamp":1578478533000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38233-8_31"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382321","9783642382338"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38233-8_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}