{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:13:48Z","timestamp":1763468028634},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208065"},{"type":"electronic","value":"9783642208072"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20807-2_8","type":"book-chapter","created":{"date-parts":[[2011,6,18]],"date-time":"2011-06-18T09:58:49Z","timestamp":1308391129000},"page":"92-103","source":"Crossref","is-referenced-by-count":6,"title":["Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems"],"prefix":"10.1007","author":[{"given":"Deeparnab","family":"Chakrabarty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chaitanya","family":"Swamy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"8_CR1","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1137\/07068151X","volume":"37","author":"A. Archer","year":"2008","unstructured":"Archer, A., Levin, A., Williamson, D.: A faster, better approximation algorithm for the minimum latency problem. SIAM J. Comput.\u00a037(5), 1472\u20131498 (2008)","journal-title":"SIAM J. Comput."},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, B., Raghavan, P., Sudan, M.: The Minimum Latency Problem. In: Proc. 26th STOC, pp. 163\u2013171 (1994)","DOI":"10.1145\/195058.195125"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-540-74208-1_3","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"J. Byrka","year":"2007","unstructured":"Byrka, J.: An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) RANDOM 2007 and APPROX 2007. LNCS, vol.\u00a04627, pp. 29\u201343. Springer, Heidelberg (2007)"},{"key":"8_CR4","unstructured":"Chakrabarty, D., Swamy, C.: Facility Location with Client Latencies: Linear Programming based Techniques for Minimum Latency Problems, http:\/\/arxiv.org\/abs\/1009.2452"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chekuri, C., Goel, A., Guha, S.: Rounding via trees: deterministic approximation algorithms for Group Steiner Trees and k-median. In: Proceedings of the 30th STOC, pp. 114\u2013123 (1998)","DOI":"10.1145\/276698.276719"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Chaudhuri, K., Godfrey, P.B., Rao, S., Talwar, K.: Paths, Trees and Minimum Latency Tours. In: Proceedings of 44th FOCS, pp. 36\u201345 (2003)","DOI":"10.1109\/SFCS.2003.1238179"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Fakcharoenphol, J., Harrelson, C., Rao, S.: The k-traveling repairman problem. ACM Trans. on Alg.\u00a03(4), Article 40 (2007)","DOI":"10.1145\/1290672.1290677"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. In: Proc. 35th STOC, pp. 448\u2013455 (2003)","DOI":"10.1145\/780542.780608"},{"issue":"4","key":"8_CR9","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s00453-004-1110-5","volume":"40","author":"U. Feige","year":"2004","unstructured":"Feige, U., Lov\u00e1sz, L., Tetali, P.: Approximating min sum set cover. Algorithmica\u00a040(4), 219\u2013234 (2004)","journal-title":"Algorithmica"},{"issue":"1","key":"8_CR10","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1006\/jagm.2000.1096","volume":"37","author":"N. Garg","year":"2000","unstructured":"Garg, N., Konjevod, G., Ravi, R.: A polylogarithmic approximation algorithm for the group Steiner tree problem. Journal of Algorithms\u00a037(1), 66\u201384 (2000)","journal-title":"Journal of Algorithms"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF01580607","volume":"60","author":"M. Goemans","year":"1993","unstructured":"Goemans, M., Bertsimas, D.: Survivable networks, linear programming relaxations and the parsimonious property. Math. Programming\u00a060, 145\u2013166 (1993)","journal-title":"Math. Programming"},{"key":"8_CR12","unstructured":"Goemans, M., Kleinberg, J.: An improved approximation ratio for the minimum latency problem. In: Proceedings of 7th SODA, pp. 152\u2013158 (1996)"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Gupta, A., Krishnaswamy, R., Nagarajan, V., Ravi, R.: Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems. In: Proceedings of 37th ICALP, pp. 690\u2013701","DOI":"10.1007\/978-3-642-14165-2_58"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Halperin, E., Krauthgamer, R.: Polylogarithmic inapproximability. In: Proceedings of 35th STOC, pp. 585\u2013594 (2003)","DOI":"10.1145\/780542.780628"},{"volume-title":"Discrete Location Theory","year":"1990","key":"8_CR15","unstructured":"Mirchandani, P., Francis, R. (eds.): Discrete Location Theory. John Wiley and Sons, Inc., New York (1990)"},{"key":"8_CR16","unstructured":"Nagarajan, V.: Approximation Algorithms for Sequencing Problems. Ph.D. thesis, Tepper School of Business, Carnegie Mellon University (2009)"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Shmoys, D.B., Tardos, \u00c9., Aardal, K.I.: Approximation algorithms for facility location problems. In: Proceedings of 29th STOC, pp. 265\u2013274 (1997)","DOI":"10.1145\/258533.258600"},{"issue":"6","key":"8_CR18","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0020-0190(90)90028-V","volume":"35","author":"D. Shmoys","year":"1990","unstructured":"Shmoys, D., Williamson, D.: Analyzing the Held-Karp TSP bound: a monotonicity property with application. Inf. Process. Lett.\u00a035(6), 281\u2013285 (1990)","journal-title":"Inf. Process. Lett."},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D. (eds.): The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia (2002)","DOI":"10.1137\/1.9780898718515"},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BFb0120913","volume":"13","author":"L. Wolsey","year":"1980","unstructured":"Wolsey, L.: Heuristic analysis, linear programming and branch and bound. Mathematical Programming Study\u00a013, 121\u2013134 (1980)","journal-title":"Mathematical Programming Study"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatoral Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20807-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T20:15:57Z","timestamp":1560284157000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20807-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208065","9783642208072"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20807-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}