{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:24:23Z","timestamp":1726410263554},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642325113"},{"type":"electronic","value":"9783642325120"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32512-0_13","type":"book-chapter","created":{"date-parts":[[2012,7,20]],"date-time":"2012-07-20T22:21:08Z","timestamp":1342822868000},"page":"146-157","source":"Crossref","is-referenced-by-count":0,"title":["A Systematic Approach to Bound Factor Revealing LPs and Its Application to the Metric and Squared Metric Facility Location Problems"],"prefix":"10.1007","author":[{"given":"Cristina G.","family":"Fernandes","sequence":"first","affiliation":[]},{"given":"Lu\u00eds A. A.","family":"Meira","sequence":"additional","affiliation":[]},{"given":"Fl\u00e1vio K.","family":"Miyazawa","sequence":"additional","affiliation":[]},{"given":"Lehilton L. C.","family":"Pedrosa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","first-page":"106","volume-title":"Proc. 30th Annual ACM Symp. on Theory of Computing","author":"S. Arora","year":"1998","unstructured":"Arora, S., Raghavan, P., Rao, S.: Approximation schemes for Euclidean k-medians and related problems. In: Proc. 30th Annual ACM Symp. on Theory of Computing, pp. 106\u2013113. ACM, New York (1998)"},{"issue":"6","key":"13_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. on Comp.\u00a039(6), 2212\u20132231 (2010)","journal-title":"SIAM J. on Comp."},{"key":"13_CR3","unstructured":"Byrka, J., Ghodsi, M., Srinivasan, A.: LP-rounding algorithms for facility-location problems (2010), \n                    \n                      http:\/\/arxiv.org\/abs\/1007.3611"},{"issue":"1","key":"13_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. on Comp.\u00a033(1), 1\u201325 (2003)","journal-title":"SIAM J. on Comp."},{"key":"13_CR5","unstructured":"Fernandes, C.G., Meira, L.A.A., Miyazawa, F.K., Pedrosa, L.L.C.: Squared Metric Facility Location Problem (2012), \n                    \n                      http:\/\/arxiv.org\/abs\/1111.1672"},{"issue":"1","key":"13_CR6","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. Journal of Algorithms\u00a031(1), 228\u2013248 (1999)","journal-title":"Journal of Algorithms"},{"key":"13_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, 148\u2013162 (1982)","journal-title":"Mathematical Programming"},{"issue":"6","key":"13_CR8","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.V.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. Journal of the ACM\u00a050(6), 795\u2013824 (2003)","journal-title":"Journal of the ACM"},{"issue":"2","key":"13_CR9","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1145\/375827.375845","volume":"48","author":"K. Jain","year":"2001","unstructured":"Jain, K., Vazirani, V.V.: Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation. Journal of the ACM\u00a048(2), 274\u2013296 (2001)","journal-title":"Journal of the ACM"},{"key":"13_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":"13_CR11","first-page":"597","volume-title":"Proc. 43rd Annual ACM Symp. on Theory of Computing","author":"M. Mahdian","year":"2011","unstructured":"Mahdian, M., Yan, Q.: Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs. In: Proc. 43rd Annual ACM Symp. on Theory of Computing, pp. 597\u2013606. ACM, New York (2011)"},{"issue":"2","key":"13_CR12","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/S0097539703435716","volume":"36","author":"M. Mahdian","year":"2006","unstructured":"Mahdian, M., Ye, Y., Zhang, J.: Approximation Algorithms for Metric Facility Location Problems. SIAM J. on Comp.\u00a036(2), 411\u2013432 (2006)","journal-title":"SIAM J. on Comp."},{"key":"13_CR13","first-page":"265","volume-title":"Proc. 29th Annual ACM Symp. on Theory of Computing","author":"D.B. Shmoys","year":"1997","unstructured":"Shmoys, D.B., Tardos, E., Aardal, K.: Approximation algorithms for facility location problems. In: Proc. 29th Annual ACM Symp. on Theory of Computing, pp. 265\u2013274. ACM, New York (1997)"},{"key":"13_CR14","unstructured":"Vygen, J.: Approximation algorithms for facility location problems (Lecture Notes). Tech. Rep. 05950-OR, Research Institute for Discrete Mathematics, University of Bonn (2005)"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32512-0_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:05:23Z","timestamp":1620129923000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32512-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642325113","9783642325120"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32512-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}