{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T06:15:26Z","timestamp":1648620926581},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2011,7,6]],"date-time":"2011-07-06T00:00:00Z","timestamp":1309910400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s00453-011-9534-1","type":"journal-article","created":{"date-parts":[[2011,7,5]],"date-time":"2011-07-05T10:42:25Z","timestamp":1309862545000},"page":"347-362","source":"Crossref","is-referenced-by-count":1,"title":["Improved Approximation Algorithms for Data Migration"],"prefix":"10.1007","volume":"63","author":[{"given":"Samir","family":"Khuller","sequence":"first","affiliation":[]},{"given":"Yoo-Ah","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Azarakhsh","family":"Malekian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,7,6]]},"reference":[{"key":"9534_CR1","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/3-540-44688-5_12","volume-title":"Workshop on Algorithm Engineering","author":"E. Anderson","year":"2001","unstructured":"Anderson, E., Hall, J., Hartline, J., Hobbes, M., Karlin, A., Saia, J., Swaminathan, R., Wilkes, J.: An experimental study of data migration algorithms. In: Workshop on Algorithm Engineering, London, UK, 2001, pp.\u00a0145\u2013158. Springer, Berlin (2001)"},{"key":"9534_CR2","first-page":"258","volume-title":"Symposium on Parallel Algorithms and Architectures","author":"G. Aggarwal","year":"2003","unstructured":"Aggarwal, G., Motwani, R., Zhu, A.: The load rebalancing problem. In: Symposium on Parallel Algorithms and Architectures, pp.\u00a0258\u2013265 (2003)"},{"key":"9534_CR3","first-page":"661","volume-title":"Proc. of ACM-SIAM Symposium on Discrete Algorithms","author":"I.D. Baev","year":"2001","unstructured":"Baev, I.D., Rajaraman, R.: Approximation algorithms for data placement in arbitrary networks. In: Proc. of ACM-SIAM Symposium on Discrete Algorithms, pp. 661\u2013670 (2001)"},{"key":"9534_CR4","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1977","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. American Elsevier, New York (1977)"},{"issue":"1","key":"9534_CR5","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/s00453-007-9118-2","volume":"54","author":"R. Gandhi","year":"2009","unstructured":"Gandhi, R., Mestre, J.: Combinatorial algorithms for data migration to minimize average completion time. Algorithmica 54(1), 54\u201371 (2009)","journal-title":"Algorithmica"},{"key":"9534_CR6","first-page":"661","volume-title":"Proc. of ACM-SIAM Symposium on Discrete Algorithms","author":"L. Golubchik","year":"2000","unstructured":"Golubchik, L., Khanna, S., Khuller, S., Thurimella, R., Zhu, A.: Approximation algorithms for data placement on parallel disks. In: Proc. of ACM-SIAM Symposium on Discrete Algorithms, Washington, D.C., USA, 2000, pp.\u00a0661\u2013670. Society of Industrial and Applied Mathematics, Philadelphia (2000)"},{"issue":"1","key":"9534_CR7","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s00453-005-1194-6","volume":"45","author":"L. Golubchik","year":"2006","unstructured":"Golubchik, L., Khuller, S., Kim, Y., Shargorodskaya, S., Wan, Y.: Data migration on parallel disks: algorithms and evaluation. Algorithmica 45(1), 137\u2013158 (2006)","journal-title":"Algorithmica"},{"key":"9534_CR8","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R.L. Graham","year":"1969","unstructured":"Graham, R.L., Grahamt, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17, 416\u2013429 (1969)","journal-title":"SIAM J. Appl. Math."},{"key":"9534_CR9","first-page":"106","volume-title":"Proc. of ACM-SIAM Symposium on Discrete Algorithms","author":"S. Guha","year":"2002","unstructured":"Guha, S., Munagala, K.: Improved algorithms for the data placement problem, 2002. In: Proc. of ACM-SIAM Symposium on Discrete Algorithms, San Fransisco, CA, USA, 2002, pp.\u00a0106\u2013107. Society of Industrial and Applied Mathematics, Philadelphia (2002)"},{"key":"9534_CR10","first-page":"620","volume-title":"Proc. of ACM-SIAM Symposium on Discrete Algorithms","author":"J. Hall","year":"2001","unstructured":"Hall, J., Hartline, J., Karlin, A., Saia, J., Wilkes, J.: On algorithms for efficient data migration. In: Proc. of ACM-SIAM Symposium on Discrete Algorithms, pp. 620\u2013629 (2001)"},{"issue":"2","key":"9534_CR11","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/j.jalgor.2004.06.007","volume":"60","author":"S. Kashyap","year":"2006","unstructured":"Kashyap, S., Khuller, S.: Algorithms for non-uniform size data placement on parallel disks. J. Algorithms 60(2), 144\u2013167 (2006)","journal-title":"J. Algorithms"},{"key":"9534_CR12","volume-title":"2006 ALENEX Conference","author":"S. Kashyap","year":"2006","unstructured":"Kashyap, S., Khuller, S., Wan, Y.C., Golubchik, L.: Fast reconfiguration of data placement in parallel disks. In: 2006 ALENEX Conference, Jan. 2006"},{"key":"9534_CR13","first-page":"373","volume-title":"European Symposia on Algorithms","author":"S. Khuller","year":"2003","unstructured":"Khuller, S., Kim, Y., Wan, Y.C.: On generalized gossiping and broadcasting. In: European Symposia on Algorithms, Budapest, Hungary, 2003, pp.\u00a0373\u2013384. Springer, Berlin (2003)"},{"issue":"2","key":"9534_CR14","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1137\/S009753970342585X","volume":"33","author":"S. Khuller","year":"2004","unstructured":"Khuller, S., Kim, Y.A., Wan, Y.C.: Algorithms for data migration with cloning. SIAM J. Comput. 33(2), 448\u2013461 (2004)","journal-title":"SIAM J. Comput."},{"key":"9534_CR15","first-page":"97","volume-title":"Proc. of ACM-SIAM Symposium on Discrete Algorithms","author":"Y. Kim","year":"2003","unstructured":"Kim, Y.: Data migration to minimize the average completion time. In: Proc. of ACM-SIAM Symposium on Discrete Algorithms, pp.\u00a097\u201398 (2003)"},{"key":"9534_CR16","first-page":"354","volume-title":"Symposium on Discrete Algorithms","author":"A. Meyerson","year":"2001","unstructured":"Meyerson, A., Munagala, K., Plotkin, S.A.: Web caching using access statistics. In: Symposium on Discrete Algorithms, pp. 354\u2013363 (2001)"},{"key":"9534_CR17","series-title":"LNCS","first-page":"238","volume-title":"Workshop on Approximation Algorithms","author":"H. Shachnai","year":"2000","unstructured":"Shachnai, H., Tamir, T.: Polynomial time approximation schemes for class-constrained packing problems. In: Workshop on Approximation Algorithms. LNCS, vol.\u00a01913, pp.\u00a0238\u2013249 (2000)"},{"key":"9534_CR18","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1007\/s004530010057","volume":"29","author":"H. Shachnai","year":"2001","unstructured":"Shachnai, H., Tamir, T.: On two class-constrained versions of the multiple knapsack problem. Algorithmica 29, 442\u2013467 (2001)","journal-title":"Algorithmica"},{"key":"9534_CR19","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1002\/sapm1949281148","volume":"28","author":"C.E. Shannon","year":"1949","unstructured":"Shannon, C.E.: A theorem on colouring lines of a network. J. Math. Phys. 28, 148\u2013151 (1949)","journal-title":"J. Math. Phys."},{"key":"9534_CR20","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/BF01585178","volume":"62","author":"D.B. Shmoys","year":"1993","unstructured":"Shmoys, D.B., Tardos, E.: An approximation algorithm for the generalized assignment problem. Math. Program., Ser. A 62, 461\u2013474 (1993)","journal-title":"Math. Program., Ser. A"},{"key":"9534_CR21","first-page":"25","volume":"3","author":"V.G. Vizing","year":"1964","unstructured":"Vizing, V.G.: On an estimate of the chromatic class of a p-graph. Diskretn. Anal. 3, 25\u201330 (1964) (Russian)","journal-title":"Diskretn. Anal."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9534-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-011-9534-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9534-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:45:07Z","timestamp":1559123107000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-011-9534-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,6]]},"references-count":21,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["9534"],"URL":"https:\/\/doi.org\/10.1007\/s00453-011-9534-1","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,6]]}}}