{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:35:37Z","timestamp":1725521737318},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540921813"},{"type":"electronic","value":"9783540921820"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92182-0_39","type":"book-chapter","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T02:38:06Z","timestamp":1228876686000},"page":"424-435","source":"Crossref","is-referenced-by-count":9,"title":["Minimizing Total Flow-Time: The Unrelated Case"],"prefix":"10.1007","author":[{"given":"Naveen","family":"Garg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. N.","family":"Muralidhara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Goel, A., Khanna, S., Kumar, A.: Multi-processor scheduling to minimize flow time with epsilon resource augmentation. In: STOC, pp. 363\u2013372 (2004)","DOI":"10.1145\/1007352.1007411"},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"Dinitz, Y., Garg, N., Goemans, M.X.: On the single-source unsplittable flow problem. In: FOCS, pp. 290\u2013299 (1998)","DOI":"10.1109\/SFCS.1998.743461"},{"key":"39_CR3","volume-title":"Computers and intractability - a guide to NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johson, D.S.: Computers and intractability - a guide to NP-completeness. W.H. Freeman and Company, New York (1979)"},{"key":"39_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/11786986_17","volume-title":"Automata, Languages and Programming","author":"N. Garg","year":"2006","unstructured":"Garg, N., Kumar, A.: Better algorithms for minimizing average flow-time on related machines. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 181\u2013190. Springer, Heidelberg (2006)"},{"key":"39_CR5","doi-asserted-by":"crossref","unstructured":"Garg, N., Kumar, A.: Minimizing average flow-time: Upper and lower bounds. In: FOCS, pp. 603\u2013613 (2007)","DOI":"10.1109\/FOCS.2007.4389529"},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"Leonardi, S., Raz, D.: Approximating total flow time on parallel machines. In: STOC, pp. 110\u2013119 (1997)","DOI":"10.1145\/258533.258562"},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Sitters, R.: Minimizing flow-time for unrelated machines. In: Personal Communication (2008)","DOI":"10.1007\/978-3-540-93980-1_6"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92182-0_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T03:44:24Z","timestamp":1557978264000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92182-0_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540921813","9783540921820"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92182-0_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}