{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T11:20:50Z","timestamp":1648552850576},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,9,7]],"date-time":"2013-09-07T00:00:00Z","timestamp":1378512000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s00224-013-9500-1","type":"journal-article","created":{"date-parts":[[2013,9,6]],"date-time":"2013-09-06T02:07:13Z","timestamp":1378433233000},"page":"613-636","source":"Crossref","is-referenced-by-count":1,"title":["On a Local Protocol for Concurrent File Transfers"],"prefix":"10.1007","volume":"55","author":[{"given":"Mohammad Taghi","family":"Hajiaghayi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rohit","family":"Khandekar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guy","family":"Kortsarz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vahid","family":"Liaghat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,9,7]]},"reference":[{"key":"9500_CR1","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"J.A. Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Graduate Texts in Mathematics, vol. 244. Springer, New York (2008)"},{"key":"9500_CR2","volume-title":"Proc. 13th Conf. Integer Prog. Combin. Optimiz. (IPCO)","author":"M.M. Halld\u00f3rsson","year":"2008","unstructured":"Halld\u00f3rsson, M.M., Kortsarz, G., Sviridenko, M.: Min sum edge coloring in multigraphs via configuration LP. In: Proc. 13th Conf. Integer Prog. Combin. Optimiz. (IPCO) (2008)"},{"key":"9500_CR3","doi-asserted-by":"crossref","unstructured":"Gandhi, R., Halld\u00f3rsson, M.M., Kortsarz, G., Shachnai, H.: Improved bounds for scheduling conflicting jobs with minsum criteria. ACM Trans. Algorithms 4(1) (2008)","DOI":"10.1145\/1328911.1328922"},{"issue":"2","key":"9500_CR4","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1006\/jagm.2001.1210","volume":"42","author":"M.M. Halld\u00f3rsson","year":"2002","unstructured":"Halld\u00f3rsson, M.M., Kortsarz, G.: Tools for multicoloring with applications to planar graphs and partial k-trees. J. Algorithms 42(2), 334\u2013366 (2002)","journal-title":"J. Algorithms"},{"issue":"1","key":"9500_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":"9500_CR6","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.jalgor.2004.07.009","volume":"55","author":"Y. Kim","year":"2005","unstructured":"Kim, Y.: Data migration to minimize the average completion time. J. Algorithms 55, 42\u201357 (2005)","journal-title":"J. Algorithms"},{"key":"9500_CR7","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0196-6774(86)90039-8","volume":"7","author":"D.S. Hochbaum","year":"1986","unstructured":"Hochbaum, D.S., Nishizeki, T., Shmoys, D.B.: A better than \u201cbest possible\u201d algorithm to edge color multigraphs. J. Algorithms 7, 79\u2013104 (1986)","journal-title":"J. Algorithms"},{"issue":"3","key":"9500_CR8","doi-asserted-by":"crossref","first-page":"744","DOI":"10.1137\/0214054","volume":"14","author":"E.G. Coffman","year":"1985","unstructured":"Coffman, E.G., Garey, M.R., Johnson, D.S., Lapaugh, A.S.: Scheduling file transfers. SIAM J. Comput. 14(3), 744\u2013780 (1985)","journal-title":"SIAM J. Comput."},{"key":"9500_CR9","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1006\/inco.1997.2677","volume":"140","author":"A. Bar-Noy","year":"1998","unstructured":"Bar-Noy, A., Bellare, M., Halld\u00f3rsson, M.M., Shachnai, H., Tamir, T.: On chromatic sums and distributed resource allocation. Inf. Comput. 140, 183\u2013202 (1998)","journal-title":"Inf. Comput."},{"issue":"1","key":"9500_CR10","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/1125994.1126001","volume":"2","author":"R. Gandhi","year":"2006","unstructured":"Gandhi, R., Halld\u00f3rsson, M.M., Kortsarz, G., Shachnai, H.: Improved results for data migration and openshop scheduling. ACM Trans. Algorithms 2(1), 116\u2013129 (2006)","journal-title":"ACM Trans. Algorithms"},{"key":"9500_CR11","volume-title":"Proc. of the 16th ACM-SIAM Symposium on Discrete Algorithms","author":"P. Sanders","year":"2005","unstructured":"Sanders, P., Steurer, D.: An asymptotic approximation scheme for multigraph edge coloring. In: Proc. of the 16th ACM-SIAM Symposium on Discrete Algorithms (2005)"},{"key":"9500_CR12","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R. Graham","year":"1966","unstructured":"Graham, R.: Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J. 45, 1563\u20131581 (1966)","journal-title":"Bell Syst. Tech. J."},{"key":"9500_CR13","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1007\/3-540-61440-0_166","volume-title":"Proc. of the 23rd International Colloquium on Automata, Languages, and Programming","author":"S. Chakrabarti","year":"1996","unstructured":"Chakrabarti, S., Phillips, C.A., Schulz, A.S., Shmoys, D.B., Stein, C., Wein, J.: Improved scheduling problems for minsum criteria. In: Proc. of the 23rd International Colloquium on Automata, Languages, and Programming. LNCS, vol. 1099, pp. 646\u2013657 (1996)"},{"key":"9500_CR14","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/3-540-69346-7_27","volume-title":"Proc. of the 6th International Conference on Integer Programming and Combinatorial Optimization","author":"H. Hoogeveen","year":"1998","unstructured":"Hoogeveen, H., Schuurman, P., Woeginger, G.: Non-approximability results for scheduling problems with minsum criteria. In: Proc. of the 6th International Conference on Integer Programming and Combinatorial Optimization. LNCS, vol. 1412, pp. 353\u2013366 (1998)"},{"key":"9500_CR15","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/S0196-6774(02)00251-1","volume":"45","author":"M. Queyranne","year":"2002","unstructured":"Queyranne, M., Sviridenko, M.: A (2+\u03f5)-approximation algorithm for generalized preemptive open shop problem with minsum objective. J. Algorithms 45, 202\u2013212 (2002)","journal-title":"J. Algorithms"},{"key":"9500_CR16","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1002\/jos.96","volume":"5","author":"M. Queyranne","year":"2002","unstructured":"Queyranne, M., Sviridenko, M.: Approximation algorithms for shop scheduling problems with minsum objective. J. Sched. 5, 287\u2013305 (2002)","journal-title":"J. Sched."},{"key":"9500_CR17","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, pp. 145\u2013158 (2001)"},{"key":"9500_CR18","first-page":"620","volume-title":"Proc. of the 12th 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 the 12th ACM-SIAM Symposium on Discrete Algorithms, pp. 620\u2013629 (2001)"},{"key":"9500_CR19","first-page":"27","volume-title":"Proc. of the 22nd ACM Symposium on Principles of Database Systems","author":"S. Khuller","year":"2003","unstructured":"Khuller, S., Kim, Y., Wan, Y.C.: Algorithms for data migration with cloning. In: Proc. of the 22nd ACM Symposium on Principles of Database Systems, pp. 27\u201336 (2003)"},{"issue":"2\u20133","key":"9500_CR20","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.tcs.2006.05.006","volume":"361","author":"D. Marx","year":"2006","unstructured":"Marx, D.: Minimum sum multicoloring on the edges of trees. Theor. Comput. Sci. 361(2\u20133), 133\u2013149 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"9500_CR21","first-page":"9","volume-title":"WAOA","author":"D. Marx","year":"2004","unstructured":"Marx, D.: Minimum sum multicoloring on the edges of planar graphs. In: WAOA, pp. 9\u201322 (2004)"},{"key":"9500_CR22","volume-title":"Computer and Intractability. A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computer and Intractability. A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"9500_CR23","first-page":"137","volume-title":"Proc. of the 6th Symposium on Operating System Design and Implementation","author":"J. Dean","year":"2004","unstructured":"Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. In: Proc. of the 6th Symposium on Operating System Design and Implementation, pp. 137\u2013150 (2004)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9500-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-013-9500-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9500-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:54:25Z","timestamp":1558698865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-013-9500-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,7]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["9500"],"URL":"https:\/\/doi.org\/10.1007\/s00224-013-9500-1","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,7]]}}}