{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:38:06Z","timestamp":1725467886077},"publisher-location":"Berlin\/Heidelberg","reference-count":10,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"0387968180"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0040381","type":"book-chapter","created":{"date-parts":[[2006,8,3]],"date-time":"2006-08-03T00:03:50Z","timestamp":1154563430000},"page":"134-138","source":"Crossref","is-referenced-by-count":16,"title":["Scheduling dags to minimize time and communication"],"prefix":"10.1007","author":[{"given":"Foto","family":"Afrati","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos H.","family":"Papadimitriou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Papageorgiou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1137\/0125042","volume":"25","author":"D. Adolphson","year":"1973","unstructured":"D. Adolphson and T. C. Hu \u201cOptimal Linear Ordering\u201d, SIAM J. Appl. Math., 25, pp. 403\u2013423, (1973).","journal-title":"SIAM J. Appl. Math."},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/BF00288685","volume":"1","author":"E. G. Coffman","year":"1972","unstructured":"E. G. Coffman, R. L. Graham \u201cOptimal Scheduling for Two Processor Systems\u201d, Acta Informatica, 1, pp. 200\u2013213, (1972).","journal-title":"Acta Informatica"},{"key":"14_CR3","unstructured":"E. G. Coffman, ed. Computer and Jobshop Scheduling Theory, Wiley, 1978."},{"key":"14_CR4","unstructured":"M. R. Garey, D. S. Johnson Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, 1979."},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1287\/mnsc.19.5.544","volume":"19","author":"E. L. Lawler","year":"1973","unstructured":"E. L. Lawler \u201cOptimal Sequencing of a Single Machine Subject to Precedence Constraints\u201d, Management Science, 19, pp. 544\u2013546, (1973).","journal-title":"Management Science"},{"key":"14_CR6","unstructured":"C. H. Papadimitriou, K. Steiglitz Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, 1983."},{"key":"14_CR7","unstructured":"C. H. Papadimitriou, J. D. Ullman. \u201cA Communication-Time Trade-off\u201d, Proc. 1985 STOC Conference; also, SIAM J. Comp., 1987."},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"C. H. Papadimitriou, M. Yannakakis \u201cTowards an Architecture-Independent Analysis of Parallel Algorithms\u201d, Proceedings 1988 STOC, to appear.","DOI":"10.1145\/62212.62262"},{"key":"14_CR9","unstructured":"E. Petrohilos, Diploma Thesis, National Technical University of Athens, 1986 (in Greek)."},{"key":"14_CR10","unstructured":"M. Prastein, manuscript, University of Illinios at Urbana-Champaign, 1987."}],"container-title":["Lecture Notes in Computer Science","VLSI Algorithms and Architectures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0040381.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:40:15Z","timestamp":1607550015000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0040381"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["0387968180"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0040381","relation":{},"subject":[]}}