{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:03:36Z","timestamp":1746331416374,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439470"},{"type":"electronic","value":"9783662439487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_52","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T16:10:36Z","timestamp":1402503036000},"page":"625-636","source":"Crossref","is-referenced-by-count":4,"title":["How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions"],"prefix":"10.1007","author":[{"given":"Wiebke","family":"H\u00f6hn","sequence":"first","affiliation":[]},{"given":"Juli\u00e1n","family":"Mestre","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Wiese","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"52_CR1","doi-asserted-by":"crossref","unstructured":"Afrati, F., Bampis, E., Chekuri, C., Karger, D., Kenyon, C., Khanna, S., Milis, I., Queyranne, M., Skutella, M., Stein, C., Sviridenko, M.: Approximation schemes for minimizing average weighted completion time with release dates. In: Proceedings of FOCS 1999, pp. 32\u201344 (1999)","DOI":"10.1109\/SFFCS.1999.814574"},{"key":"52_CR2","doi-asserted-by":"crossref","unstructured":"Anagnostopoulos, A., Grandoni, F., Leonardi, S., Wiese, A.: A mazing 2+\u03b5 approximation for unsplittable flow on a path. In: Proceedings of SODA 2014, pp. 26\u201341 (2014)","DOI":"10.1137\/1.9781611973402.3"},{"key":"52_CR3","doi-asserted-by":"crossref","unstructured":"Bansal, N., Chakrabarti, A., Epstein, A., Schieber, B.: A quasi-PTAS for unsplittable flow on line graphs. In: Proceedings of STOC 2006, pp. 721\u2013729 (2006)","DOI":"10.1145\/1132516.1132617"},{"key":"52_CR4","doi-asserted-by":"crossref","unstructured":"Bansal, N., Dhamdhere, K.: Minimizing weighted flow time. ACM T. Alg.\u00a03(4), article 39 (2007)","DOI":"10.1145\/1290672.1290676"},{"key":"52_CR5","doi-asserted-by":"crossref","unstructured":"Bansal, N., Friggstad, Z., Khandekar, R., Salavatipour, R.: A logarithmic approximation for unsplittable flow on line graphs. In: Proceedings of SODA 2009, pp. 702\u2013709 (2009)","DOI":"10.1137\/1.9781611973068.77"},{"key":"52_CR6","doi-asserted-by":"crossref","unstructured":"Bansal, N., Pruhs, K.: The geometry of scheduling. In: Proceedings of FOCS 2010, pp. 407\u2013414 (2010), See also http:\/\/www.win.tue.nl\/~nikhil\/pubs\/wflow-journ3.pdf","DOI":"10.1109\/FOCS.2010.46"},{"key":"52_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-642-33090-2_14","volume-title":"Algorithms \u2013 ESA 2012","author":"N. Bansal","year":"2012","unstructured":"Bansal, N., Pruhs, K.: Weighted geometric set multi-cover via quasi-uniform sampling. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol.\u00a07501, pp. 145\u2013156. Springer, Heidelberg (2012)"},{"key":"52_CR8","unstructured":"Bansal, N., Verschae, J.: Personal communication"},{"issue":"5","key":"52_CR9","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. ACM\u00a048(5), 1069\u20131090 (2001)","journal-title":"J. ACM"},{"issue":"3","key":"52_CR10","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1137\/050625382","volume":"19","author":"R. Bar-Yehuda","year":"2005","unstructured":"Bar-Yehuda, R., Rawitz, D.: On the equivalence between the primal-dual schema and the local ratio technique. SIAM J. Discrete Math.\u00a019(3), 762\u2013797 (2005)","journal-title":"SIAM J. Discrete Math."},{"key":"52_CR11","doi-asserted-by":"crossref","unstructured":"Bonsma, P., Schulz, J., Wiese, A.: A constant factor approximation algorithm for unsplittable flow on paths. In: Proceedings of FOCS 2011, pp. 47\u201356 (2011)","DOI":"10.1109\/FOCS.2011.10"},{"key":"52_CR12","unstructured":"Carr, R.D., Fleischer, L.K., Leung, V.J., Phillips, C.A.: Strengthening integrality gaps for capacitated network design and covering problems. In: Proceedings of SODA 2000, pp. 106\u2013115 (2000)"},{"key":"52_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-642-23719-5_46","volume-title":"Algorithms \u2013 ESA 2011","author":"V.T. Chakaravarthy","year":"2011","unstructured":"Chakaravarthy, V.T., Kumar, A., Roy, S., Sabharwal, Y.: Resource allocation for covering time varying demands. In: Demetrescu, C., Halld\u00f3rsson, M.M. (eds.) ESA 2011. LNCS, vol.\u00a06942, pp. 543\u2013554. Springer, Heidelberg (2011)"},{"key":"52_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-45753-4_7","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"A. Chakrabarti","year":"2002","unstructured":"Chakrabarti, A., Chekuri, C., Gupta, A., Kumar, A.: Approximation algorithms for the unsplittable flow problem. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol.\u00a02462, pp. 51\u201366. Springer, Heidelberg (2002)"},{"key":"52_CR15","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Khanna, S.: Approximation schemes for preemptive weighted flow time. In: Proceedings of STOC 2002, pp. 297\u2013305 (2002)","DOI":"10.1145\/509907.509954"},{"key":"52_CR16","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Khanna, S., Zhu, A.: Algorithms for minimizing weighted flow time. In: Proceedings of STOC 2001, pp. 84\u201393 (2001)","DOI":"10.1145\/380752.380778"},{"key":"52_CR17","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Mydlarz, M., Shepherd, F.: Multicommodity demand flow in a tree and packing integer programs. ACM T. Alg.\u00a03(3), article 27 (2007)","DOI":"10.1145\/1273340.1273343"},{"key":"52_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-22935-0_12","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"M. Cheung","year":"2011","unstructured":"Cheung, M., Shmoys, D.B.: A primal-dual approximation algorithm for min-sum single-machine scheduling problems. In: Goldberg, L.A., Jansen, K., Ravi, R., Rolim, J.D.P. (eds.) RANDOM 2011 and APPROX 2011. LNCS, vol.\u00a06845, pp. 135\u2013146. Springer, Heidelberg (2011)"},{"issue":"1","key":"52_CR19","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1006\/inco.1996.0092","volume":"131","author":"M.-Y. Kao","year":"1996","unstructured":"Kao, M.-Y., Reif, J.H., Tate, S.R.: Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem. Inform. Comput.\u00a0131(1), 63\u201379 (1996)","journal-title":"Inform. Comput."},{"key":"52_CR20","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","volume":"1","author":"E.L. Lawler","year":"1977","unstructured":"Lawler, E.L.: A \u201cpseudopolynomial\u201d algorithm for sequencing jobs to minimize total tardiness. Ann. Discrete Math.\u00a01, 331\u2013342 (1977)","journal-title":"Ann. Discrete Math."},{"key":"52_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1007\/978-3-642-39206-1_63","volume-title":"Automata, Languages, and Programming","author":"N. Megow","year":"2013","unstructured":"Megow, N., Verschae, J.: Dual techniques for scheduling on a machine with varying speed. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part I. LNCS, vol.\u00a07965, pp. 745\u2013756. Springer, Heidelberg (2013)"},{"key":"52_CR22","unstructured":"Mestre, J., Verschae, J.: A 4-approximation for scheduling on a single machine with general cost function, http:\/\/arxiv.org\/abs\/1403.0298"},{"issue":"1-3","key":"52_CR23","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/BF01585178","volume":"62","author":"D.B. Shmoys","year":"1993","unstructured":"Shmoys, D.B., Tardos, \u00c9.: An approximation algorithm for the generalized assignment problem. Math. Program.\u00a062(1-3), 461\u2013474 (1993)","journal-title":"Math. Program."},{"key":"52_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-642-36694-9_33","volume-title":"Integer Programming and Combinatorial Optimization","author":"M. Sviridenko","year":"2013","unstructured":"Sviridenko, M., Wiese, A.: Approximating the configuration-LP for minimizing weighted sum of completion times on unrelated machines. In: Goemans, M., Correa, J. (eds.) IPCO 2013. LNCS, vol.\u00a07801, pp. 387\u2013398. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43948-7_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:31:09Z","timestamp":1746264669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43948-7_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}