{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T17:29:48Z","timestamp":1648747788943},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,3,10]],"date-time":"2015-03-10T00:00:00Z","timestamp":1425945600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s00453-015-9978-9","type":"journal-article","created":{"date-parts":[[2015,3,9]],"date-time":"2015-03-09T11:20:45Z","timestamp":1425900045000},"page":"969-991","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["New Approximation Results for Resource Replication Problems"],"prefix":"10.1007","volume":"74","author":[{"given":"Samir","family":"Khuller","sequence":"first","affiliation":[]},{"given":"Barna","family":"Saha","sequence":"additional","affiliation":[]},{"given":"Kanthi K.","family":"Sarpatwar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,3,10]]},"reference":[{"key":"9978_CR1","unstructured":"Baev, I.D., Rajaraman, R.: Approximation algorithms for data placement in arbitrary networks. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 661\u2013670 (2001)"},{"issue":"4","key":"9978_CR2","doi-asserted-by":"crossref","first-page":"1411","DOI":"10.1137\/080715421","volume":"38","author":"ID Baev","year":"2008","unstructured":"Baev, I.D., Rajaraman, R., Swamy, C.: Approximation algorithms for data placement problems. SIAM J. Comput. 38(4), 1411\u20131429 (2008)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9978_CR3","doi-asserted-by":"crossref","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 15(3), 385\u2013415 (1993)","journal-title":"J. Algorithms"},{"key":"9978_CR4","doi-asserted-by":"crossref","unstructured":"Charikar, M., Khuller, S.: A robust maximum completion time measure for scheduling. In: ACM\u2013SIAM Symposium on Discrete Algorithms, pp. 324\u2013333 (2006)","DOI":"10.1145\/1109557.1109594"},{"key":"9978_CR5","unstructured":"Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for facility location problems with outliers. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 642\u2013651 (2001)"},{"key":"9978_CR6","doi-asserted-by":"crossref","unstructured":"Edmonds, J.: Paths, trees, and flowers. In: Classic Papers in Combinatorics, Modern Birkhuser Classics, pp. 361\u2013379. Birkhuser, Boston (1987)","DOI":"10.1007\/978-0-8176-4842-8_26"},{"issue":"3","key":"9978_CR7","doi-asserted-by":"crossref","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. J. Comb. Theory 8(3), 299\u2013306 (1970)","journal-title":"J. Comb. Theory"},{"key":"9978_CR8","doi-asserted-by":"crossref","unstructured":"Feige, U., Halld\u00f3rsson, M.M., Kortsarz, G.: Approximating the domatic number. In: ACM Symposium on the Theory of Computing, pp. 134\u2013143 (2000)","DOI":"10.1145\/335305.335321"},{"key":"9978_CR9","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY (1990)"},{"key":"9978_CR10","doi-asserted-by":"crossref","unstructured":"Golubchik, L., Khanna, S., Khuller, S., Thurimella, R., Zhu, A.: Approximation algorithms for data placement on parallel disks. ACM Trans. Algorithms 5(4), 34 (2009)","DOI":"10.1145\/1597036.1597037"},{"key":"9978_CR11","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"TF Gonzalez","year":"1985","unstructured":"Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci. 38, 293\u2013306 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"9978_CR12","unstructured":"Guha, S., Munagala, K.: Improved algorithms for the data placement problem. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 106\u2013107 (2002)"},{"key":"9978_CR13","doi-asserted-by":"crossref","unstructured":"Gupta, A., Krishnaswamy, R., Kumar, A., Segev, D.: Scheduling with outliers. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX-RANDOM), pp. 149\u2013162 (2009)","DOI":"10.1007\/978-3-642-03685-9_12"},{"issue":"2","key":"9978_CR14","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A best possible heuristic for the k-center problem. Math. Oper. Res. 10(2), 180\u2013184 (1985)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"9978_CR15","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/5925.5933","volume":"33","author":"DS Hochbaum","year":"1986","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A unified approach to approximation algorithms for bottleneck problems. J. ACM 33(3), 533\u2013550 (1986)","journal-title":"J. ACM"},{"issue":"3","key":"9978_CR16","doi-asserted-by":"crossref","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. 13(3), 403\u2013418 (2000)","journal-title":"SIAM J. Discrete Math."},{"key":"9978_CR17","unstructured":"Ko, B.-J., Rubenstein, D.: Distributed, self-stabilizing placement of replicated resources in emerging networks. In: IEEE International Conference on Network Protocols, pp. 6\u201315 (2003)"},{"key":"9978_CR18","doi-asserted-by":"crossref","unstructured":"Ko, B.-J., Rubenstein, D.: Distributed server replication in large scale networks. In: International Workshop on Network and Operating Systems Support for Digital Audio and Video, pp. 127\u2013132 (2004)","DOI":"10.1145\/1005847.1005875"},{"key":"9978_CR19","unstructured":"Korupolu, M.R., Plaxton, C.G., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 1\u201310 (1998)"},{"key":"9978_CR20","doi-asserted-by":"crossref","unstructured":"Krishnaswamy, R., Kumar, A., Nagarajan, V., Sabharwal, Y., Saha, B.: The matroid median problem. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 1117\u20131130 (2011)","DOI":"10.1137\/1.9781611973082.84"},{"key":"9978_CR21","doi-asserted-by":"crossref","unstructured":"Luby, M.: A simple parallel algorithm for the maximal independent set problem. In: ACM Symposium on the Theory of Computing, pp. 1\u201310 (1985)","DOI":"10.1145\/22145.22146"},{"key":"9978_CR22","unstructured":"Meyerson, A., Munagala, K., Plotkin, S.A.: Web caching using access statistics. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 354\u2013363 (2001)"},{"key":"9978_CR23","unstructured":"Saha, B., Srinivasan, A.: A new approximation technique for resource-allocation problems. In: Innovations in Computer Science, pp. 342\u2013357 (2010)"},{"key":"9978_CR24","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Berlin (2001)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-9978-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-015-9978-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-9978-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T15:57:03Z","timestamp":1566403023000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-015-9978-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,10]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["9978"],"URL":"https:\/\/doi.org\/10.1007\/s00453-015-9978-9","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,10]]}}}