{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T08:15:27Z","timestamp":1787386527783,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642130359","type":"print"},{"value":"9783642130366","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13036-6_19","type":"book-chapter","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:36:09Z","timestamp":1276000569000},"page":"244-257","source":"Crossref","is-referenced-by-count":24,"title":["Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm"],"prefix":"10.1007","author":[{"given":"Jaroslaw","family":"Byrka","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aravind","family":"Srinivasan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chaitanya","family":"Swamy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"3","key":"19_CR1","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1023\/B:JOCO.0000038913.96607.c2","volume":"8","author":"A. Ageev","year":"2004","unstructured":"Ageev, A., Sviridenko, M.: Pipage rounding: a new method of constructing algorithms with proven performance guarantee. Journal of Combinatorial Optimization\u00a08(3), 307\u2013328 (2004)","journal-title":"Journal of Combinatorial Optimization"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Byrka, J.: An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. In: APPROX-RANDOM, pp. 29\u201343 (2007)","DOI":"10.1007\/978-3-540-74208-1_3"},{"key":"19_CR3","unstructured":"Byrka, J., Srinivasan, A., Swamy, C.: Fault-tolerant facility location: a randomized dependent LP-rounding algorithm. arXiv:1003.1295v1"},{"issue":"1","key":"19_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539703405754","volume":"33","author":"F.A. Chudak","year":"2003","unstructured":"Chudak, F.A., Shmoys, D.B.: Improved approximation algorithms for the uncapacitated facility location problem. SIAM J.\u00a0Comput.\u00a033(1), 1\u201325 (2003)","journal-title":"SIAM J.\u00a0Comput."},{"issue":"1","key":"19_CR5","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1006\/jagm.1998.0993","volume":"31","author":"S. Guha","year":"1999","unstructured":"Guha, S., Khuller, S.: Greedy strikes back: Improved facility location algorithms. J. Algorithms\u00a031(1), 228\u2013248 (1999)","journal-title":"J. Algorithms"},{"issue":"2","key":"19_CR6","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"},{"issue":"3","key":"19_CR7","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.V.: An approximation algorithm for the fault tolerant metric facility location problem. Algorithmica\u00a038(3), 433\u2013439 (2003)","journal-title":"Algorithmica"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Lin, J.-H., Vitter, J.S.: Epsilon-approximations with minimum packing constraint violation (extended abstract). In: STOC, pp. 771\u2013782 (1992)","DOI":"10.1145\/129712.129787"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Shmoys, D.B., Tardos, \u00c9., Aardal, K.: Approximation algorithms for facility location problems (extended abstract). In: STOC, pp. 265\u2013274 (1997)","DOI":"10.1145\/258533.258600"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Srinivasan, A.: Distributions on level-sets with applications to approximation algorithms. In: FOCS, pp. 588\u2013597 (2001)","DOI":"10.1109\/SFCS.2001.959935"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Swamy, C., Shmoys, D.B.: Fault-tolerant facility location. ACM Transactions on Algorithms\u00a04(4) (2008)","DOI":"10.1145\/1383369.1383382"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13036-6_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:00:20Z","timestamp":1606186820000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13036-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130359","9783642130366"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13036-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}