{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,28]],"date-time":"2026-10-28T22:25:04Z","timestamp":1793226304001,"version":"4.5.0"},"reference-count":14,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1985,8]]},"abstract":"<jats:p>We consider a problem of scheduling file transfers in a network so as to minimize overall finishing time. Although the general problem is NP-complete, we identify polynomial time solvable special cases and derive good performance bounds for several natural approximation algorithms, assuming the existence of a central controller. We also show how these bounds can be maintained in a distributed regime.<\/jats:p>","DOI":"10.1137\/0214054","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:25:35Z","timestamp":1109226335000},"page":"744-780","source":"Crossref","is-referenced-by-count":142,"title":["Scheduling File Transfers"],"prefix":"10.1137","volume":"14","author":[{"given":"E. G.","family":"Coffman, Jr.","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M. R.","family":"Garey","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"D. S.","family":"Johnson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A. S.","family":"LaPaugh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,8,2]]},"reference":[{"key":"R1","volume-title":"Graphs and Hypergraphs","author":"Berge C.","year":"1973"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1137\/0207001"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1137\/0211043"},{"key":"R4","unstructured":"S. Even, O. Goldreich, P. Tong,  On the NP-completeness of certain network-testing problems, Report, 230, Department of Computer Science, Technion, Haifa, Israel,  1981"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1137\/0213013"},{"key":"R6","unstructured":"H. N. Gabow,  1982, private communication"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1137\/0211009"},{"key":"R8","volume-title":"Computers and intractability","author":"Garey Michael R.","year":"1979"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190080115"},{"key":"R10","unstructured":"M. K. Goldberg,  1983, private communication"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1137\/0210055"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321934"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1002\/sapm1949281148"},{"key":"R14","first-page":"25","volume":"3","author":"Vizing V. G.","year":"1964","journal-title":"Diskret. Analiz No."}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0214054","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:39:19Z","timestamp":1787337559000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0214054"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,8]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,8]]}},"alternative-id":["10.1137\/0214054"],"URL":"https:\/\/doi.org\/10.1137\/0214054","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,8]]}}}