{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T12:10:19Z","timestamp":1738239019386,"version":"3.34.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540688860"},{"type":"electronic","value":"9783540688914"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68891-4_22","type":"book-chapter","created":{"date-parts":[[2008,5,23]],"date-time":"2008-05-23T13:31:37Z","timestamp":1211549497000},"page":"316-330","source":"Crossref","is-referenced-by-count":3,"title":["Importance Sampling via Load-Balanced Facility Location"],"prefix":"10.1007","author":[{"given":"Aaron","family":"Archer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shankar","family":"Krishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","unstructured":"Arthur, D., Vassilvitskii, S.: k-means++: The advantages of careful seeding. In: SODA, pp. 1027\u20131035 (2007)"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/978-3-540-27836-8_19","volume-title":"Automata, Languages and Programming","author":"N. Bansal","year":"2004","unstructured":"Bansal, N., Fleischer, L., Kimbrel, T., Mahdian, M., Schieber, B., Sviridenko, M.: Further improvements in competitive guarantees for QoS buffering. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 196\u2013207. Springer, Heidelberg (2004)"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V. Chvatal","year":"1979","unstructured":"Chvatal, V.: A greedy heuristic for the set covering problem. Math. Oper. Res.\u00a04, 233\u2013235 (1979)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"22_CR4","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/38.988744","volume":"22","author":"P. Debevec","year":"2002","unstructured":"Debevec, P.: Image-based lighting. IEEE Comput. Graph.\u00a022(2), 26\u201334 (2002)","journal-title":"IEEE Comput. Graph."},{"key":"22_CR5","unstructured":"Garg, N., Khandekar, R., Pandit, V.: Improved approximation for universal facility location. In: SODA, pp. 959\u2013960 (2005)"},{"key":"22_CR6","first-page":"111","volume":"82","author":"M.X. Goemans","year":"1998","unstructured":"Goemans, M.X., Kleinberg, J.M.: An improved approximation ratio for the minimum latency problem. Math. Program.\u00a082, 111\u2013124 (1998)","journal-title":"Math. Program."},{"issue":"1","key":"22_CR7","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. Algorithm\u00a031(1), 228\u2013248 (1999)","journal-title":"J. Algorithm"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Guha, S., Meyerson, A., Munagala, K.: Hierarchical placement and network design problems. In: FOCS, pp. 603\u2013612 (2000)","DOI":"10.1109\/SFCS.2000.892328"},{"issue":"6","key":"22_CR9","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1002\/net.10080","volume":"42","author":"M.T. Hajiaghayi","year":"2003","unstructured":"Hajiaghayi, M.T., Mahdian, M., Mirrokni, V.S.: The facility location problem with general cost functions. Networks\u00a042(6), 42\u201347 (2003)","journal-title":"Networks"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1007\/978-3-540-31856-9_53","volume-title":"STACS 2005","author":"N. Immorlica","year":"2005","unstructured":"Immorlica, N., Mahdian, M., Mirrokni, V.S.: Cycle cover with short cycles. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 641\u2013653. Springer, Heidelberg (2005)"},{"issue":"6","key":"22_CR11","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. J. ACM\u00a050(6), 795\u2013824 (2003)","journal-title":"J. ACM"},{"key":"22_CR12","unstructured":"Jain, M.R.S.K., Mahdian, M.: Packing Steiner trees. In: SODA, pp. 266\u2013274 (2003)"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Karger, D.R., Minkoff, M.: Building Steiner trees with incomplete global knowledge. In: FOCS, pp. 613\u2013623 (2000)","DOI":"10.1109\/SFCS.2000.892329"},{"key":"22_CR14","unstructured":"Mahdian, M.: Facility Location and the Analysis of Algorithms through Factor-Revealing Programs. PhD thesis, MIT, Cambridge, MA (June 2004)"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/978-3-540-39658-1_38","volume-title":"Algorithms - ESA 2003","author":"M. Mahdian","year":"2003","unstructured":"Mahdian, M., P\u00e1l, M.: Universal facility location. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 409\u2013421. Springer, Heidelberg (2003)"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-45753-4_20","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"M. Mahdian","year":"2002","unstructured":"Mahdian, M., Ye, Y., Zhang, J.: Improved approximation algorithms for metric facility location problems. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol.\u00a02462, pp. 229\u2013242. Springer, Heidelberg (2002)"},{"key":"22_CR17","unstructured":"Svitkina, Z.: Lower-bounded facility location. In: SODA, pp. 1154\u20131163 (2008)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68891-4_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T11:30:38Z","timestamp":1738236638000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68891-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540688860","9783540688914"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68891-4_22","relation":{},"subject":[]}}