{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:51:22Z","timestamp":1725742282251},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642400469"},{"type":"electronic","value":"9783642400476"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40047-6_12","type":"book-chapter","created":{"date-parts":[[2013,7,20]],"date-time":"2013-07-20T12:18:02Z","timestamp":1374322682000},"page":"90-101","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Scheduling Jobs with Multiple Non-uniform Tasks"],"prefix":"10.1007","author":[{"given":"Venkatesan T.","family":"Chakaravarthy","sequence":"first","affiliation":[]},{"given":"Anamitra","family":"Roy Choudhury","sequence":"additional","affiliation":[]},{"given":"Sambuddha","family":"Roy","sequence":"additional","affiliation":[]},{"given":"Yogish","family":"Sabharwal","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-3","key":"12_CR1","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0166-218X(96)00063-7","volume":"71","author":"V. Bafna","year":"1996","unstructured":"Bafna, V., Narayanan, B., Ravi, R.: Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles). Discrete Applied Math.\u00a071(1-3), 41\u201353 (1996)","journal-title":"Discrete Applied Math."},{"issue":"5","key":"12_CR2","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1145\/502102.502107","volume":"48","author":"A. Bar-Noy","year":"2001","unstructured":"Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J., Schieber, B.: A unified approach to approximating resource allocation and scheduling. J. of the ACM\u00a048(5), 1069\u20131090 (2001)","journal-title":"J. of the ACM"},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539703437843","volume":"36","author":"R. Bar-Yehuda","year":"2006","unstructured":"Bar-Yehuda, R., Halld\u00f3rsson, M., Naor, J., Shachnai, H., Shapira, I.: Scheduling split intervals. SIAM Journal of Computing\u00a036(1), 1\u201315 (2006)","journal-title":"SIAM Journal of Computing"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1007\/11561071_63","volume-title":"Algorithms \u2013 ESA 2005","author":"R. Bar-Yehuda","year":"2005","unstructured":"Bar-Yehuda, R., Rawitz, D.: Using fractional primal-dual to schedule split intervals with demands. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 714\u2013725. Springer, Heidelberg (2005)"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Berman, P., DasGupta, B., Muthukrishnan, S.: Simple approximation algorithm for nonoverlapping local alignments. In: SODA (2002)","DOI":"10.1007\/978-1-4613-0259-9_7"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Bonsma, P., Schulz, J., Wiese, A.: A constant factor approximation algorithm for unsplittable flow on paths. In: FOCS (2011)","DOI":"10.1109\/FOCS.2011.10"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/3-540-47867-1_28","volume-title":"Integer Programming and Combinatorial Optimization","author":"G. Calinescu","year":"2002","unstructured":"Calinescu, G., Chakrabarti, A., Karloff, H., Rabani, Y.: Improved approximation algorithms for resource allocation. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol.\u00a02337, pp. 401\u2013414. Springer, Heidelberg (2002)"},{"issue":"1","key":"12_CR8","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s00453-006-1210-5","volume":"47","author":"A. Chakrabarti","year":"2007","unstructured":"Chakrabarti, A., Chekuri, C., Gupta, A., Kumar, A.: Approximation algorithms for the unsplittable flow problem. Algorithmica\u00a047(1), 53\u201378 (2007)","journal-title":"Algorithmica"},{"issue":"4","key":"12_CR9","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1137\/S0097539799356265","volume":"33","author":"C. Chekuri","year":"2004","unstructured":"Chekuri, C., Khanna, S.: On multidimensional packing problems. SIAM J. Comput.\u00a033(4), 837\u2013851 (2004)","journal-title":"SIAM J. Comput."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms And Combinatorial Optimization. Springer (1993)","DOI":"10.1007\/978-3-642-78240-4"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2013 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40047-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T01:08:30Z","timestamp":1587344910000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40047-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642400469","9783642400476"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40047-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}