{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:59:18Z","timestamp":1725469158804},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642325113"},{"type":"electronic","value":"9783642325120"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-32512-0_19","type":"book-chapter","created":{"date-parts":[[2012,7,20]],"date-time":"2012-07-20T18:21:08Z","timestamp":1342808468000},"page":"218-230","source":"Crossref","is-referenced-by-count":2,"title":["New Approximation Results for Resource Replication Problems"],"prefix":"10.1007","author":[{"given":"Samir","family":"Khuller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barna","family":"Saha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kanthi K.","family":"Sarpatwar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","unstructured":"Baev, I.D., Rajaraman, R.: Approximation algorithms for data placement in arbitrary networks. In: SODA, pp. 661\u2013670 (2001)"},{"issue":"4","key":"19_CR2","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1137\/080715421","volume":"38","author":"I.D. Baev","year":"2008","unstructured":"Baev, I.D., Rajaraman, R., Swamy, C.: Approximation algorithms for data placement problems. SIAM J. Comput.\u00a038(4), 1411\u20131429 (2008)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"19_CR3","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1006\/jagm.1993.1047","volume":"15","author":"J. Bar-Ilan","year":"1993","unstructured":"Bar-Ilan, J., Kortsarz, G., Peleg, D.: How to allocate network centers. J. Algorithms\u00a015(3), 385\u2013415 (1993)","journal-title":"J. Algorithms"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Charikar, M., Khuller, S.: A robust maximum completion time measure for scheduling. In: SODA, pp. 324\u2013333 (2006)","DOI":"10.1145\/1109557.1109594"},{"key":"19_CR5","unstructured":"Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for facility location problems with outliers. In: SODA, pp. 642\u2013651 (2001)"},{"key":"19_CR6","first-page":"361","volume-title":"Classic Papers in Combinatorics","author":"J. Edmonds","year":"1987","unstructured":"Edmonds, J.: Paths, trees, and flowers. In: Gessel, I., Rota, G.-C. (eds.) Classic Papers in Combinatorics, Modern Birkhuser Classics, pp. 361\u2013379. Birkhuser, Boston (1987)"},{"issue":"3","key":"19_CR7","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0021-9800(70)80083-7","volume":"8","author":"J. Edmonds","year":"1970","unstructured":"Edmonds, J., Fulkerson, D.R.: Bottleneck extrema. Journal of Combinatorial Theory\u00a08(3), 299\u2013306 (1970)","journal-title":"Journal of Combinatorial Theory"},{"issue":"3","key":"19_CR8","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/s004530010050","volume":"29","author":"U. Feige","year":"2001","unstructured":"Feige, U., Peleg, D., Kortsarz, G.: The dense k-subgraph problem. Algorithmica\u00a029(3), 410\u2013421 (2001)","journal-title":"Algorithmica"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Golubchik, L., Khanna, S., Khuller, S., Thurimella, R., Zhu, A.: Approximation algorithms for data placement on parallel disks. ACM Transactions on Algorithms\u00a05(4) (2009)","DOI":"10.1145\/1597036.1597037"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"T.F. Gonzalez","year":"1985","unstructured":"Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci.\u00a038, 293\u2013306 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR11","unstructured":"Guha, S., Munagala, K.: Improved algorithms for the data placement problem. In: SODA, pp. 106\u2013107 (2002)"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-642-03685-9_12","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"A. Gupta","year":"2009","unstructured":"Gupta, A., Krishnaswamy, R., Kumar, A., Segev, D.: Scheduling with Outliers. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX and RANDOM 2009. LNCS, vol.\u00a05687, pp. 149\u2013162. Springer, Heidelberg (2009)"},{"issue":"2","key":"19_CR13","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"D.S. Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A best possible heuristic for the k-center problem. Mathematics of Operations Research\u00a010(2), 180\u2013184 (1985)","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"19_CR14","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1145\/5925.5933","volume":"33","author":"D.S. Hochbaum","year":"1986","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A unified approach to approximation algorithms for bottleneck problems. J. ACM\u00a033(3), 533\u2013550 (1986)","journal-title":"J. ACM"},{"issue":"3","key":"19_CR15","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1137\/S0895480197329776","volume":"13","author":"S. Khuller","year":"2000","unstructured":"Khuller, S., Sussmann, Y.J.: The capacitated k-center problem. SIAM J. Discrete Math.\u00a013(3), 403\u2013418 (2000)","journal-title":"SIAM J. Discrete Math."},{"key":"19_CR16","unstructured":"Ko, B.-J., Rubenstein, D.: Distributed, self-stabilizing placement of replicated resources in emerging networks. In: ICNP, pp. 6\u201315 (2003)"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Ko, B.-J., Rubenstein, D.: Distributed server replication in large scale networks. In: NOSSDAV, pp. 127\u2013132 (2004)","DOI":"10.1145\/1005847.1005875"},{"key":"19_CR18","unstructured":"Korupolu, M.R., Greg Plaxton, C., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. In: SODA, pp. 1\u201310 (1998)"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Krishnaswamy, R., Kumar, A., Nagarajan, V., Sabharwal, Y., Saha, B.: The matroid median problem. In: SODA, pp. 1117\u20131130 (2011)","DOI":"10.1137\/1.9781611973082.84"},{"key":"19_CR20","unstructured":"Meyerson, A., Munagala, K., Plotkin, S.A.: Web caching using access statistics. In: SODA, pp. 354\u2013363 (2001)"},{"key":"19_CR21","unstructured":"Saha, B., Srinivasan, A.: A new approximation technique for resource-allocation problems. In: ICS, pp. 342\u2013357 (2010)"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32512-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:06:53Z","timestamp":1558300013000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32512-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642325113","9783642325120"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32512-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}