{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:14:56Z","timestamp":1725563696305},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157745"},{"type":"electronic","value":"9783642157752"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15775-2_4","type":"book-chapter","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T14:47:32Z","timestamp":1283352452000},"page":"36-47","source":"Crossref","is-referenced-by-count":9,"title":["A Robust PTAS for Machine Covering and Packing"],"prefix":"10.1007","author":[{"given":"Martin","family":"Skutella","sequence":"first","affiliation":[]},{"given":"Jos\u00e9","family":"Verschae","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-003-0436-0","volume":"97","author":"S. Albers","year":"2003","unstructured":"Albers, S.: Online algorithms: a survey. Mathematical Programming\u00a097, 3\u201326 (2003)","journal-title":"Mathematical Programming"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J","volume":"1","author":"N. Alon","year":"1998","unstructured":"Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation schemes for scheduling on parallel machines. Journal of Scheduling\u00a01, 55\u201366 (1998)","journal-title":"Journal of Scheduling"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/PL00009263","volume":"23","author":"M. Andrews","year":"1999","unstructured":"Andrews, M., Goemans, M., Zhang, L.: Improved bounds for on-line load balancing. Algorithmica\u00a023, 278\u2013301 (1999)","journal-title":"Algorithmica"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/BFb0029569","volume-title":"Online Algorithms","author":"Y. Azar","year":"1998","unstructured":"Azar, Y.: On-line load balancing. In: Fiat, A., Woeginger, G.J. (eds.) Dagstuhl Seminar 1996. LNCS, vol.\u00a01442, pp. 178\u2013195. Springer, Heidelberg (1998)"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1002\/(SICI)1099-1425(199808)1:2<67::AID-JOS6>3.0.CO;2-Y","volume":"1","author":"Y. Azar","year":"1998","unstructured":"Azar, Y., Epstein, L.: On-line machine covering. Journal of Scheduling\u00a01, 67\u201377 (1998)","journal-title":"Journal of Scheduling"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0020-0190(94)00110-3","volume":"51","author":"B. Chen","year":"1994","unstructured":"Chen, B., van Vliet, A., Woeginger, G.J.: Lower bounds for randomized online scheduling. Information Processing Letters\u00a051, 219\u2013222 (1994)","journal-title":"Information Processing Letters"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10107-007-0200-y","volume":"119","author":"L. Epstein","year":"2009","unstructured":"Epstein, L., Levin, A.: A robust APTAS for the classical bin packing problem. Mathematical Programming\u00a0119, 33\u201349 (2009)","journal-title":"Mathematical Programming"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1002\/1099-1425(200011\/12)3:6<343::AID-JOS54>3.0.CO;2-2","volume":"3","author":"R. Fleischer","year":"2000","unstructured":"Fleischer, R., Wahl, M.: Online scheduling revisited. Journal of Scheduling\u00a03, 343\u2013353 (2000)","journal-title":"Journal of Scheduling"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"D.S. Hochbaum","year":"1987","unstructured":"Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems theoretical and practical results. Journal of the ACM\u00a034, 144\u2013162 (1987)","journal-title":"Journal of the ACM"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1137\/S0097539702403438","volume":"32","author":"J.F. Rudin III","year":"2003","unstructured":"Rudin III, J.F., Chandrasekaran, R.: Improved bounds for the online scheduling problem. SIAM Journal on Computing\u00a032, 717\u2013735 (2003)","journal-title":"SIAM Journal on Computing"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1287\/moor.1090.0381","volume":"34","author":"P. Sanders","year":"2009","unstructured":"Sanders, P., Sivadasan, N., Skutella, M.: Online scheduling with bounded migration. Mathematics of Operations Research\u00a034, 481\u2013498 (2009)","journal-title":"Mathematics of Operations Research"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0020-0190(97)00093-8","volume":"63","author":"J. Sgall","year":"1997","unstructured":"Sgall, J.: A lower bound for randomized on-line multiprocessor scheduling. Information Processing Letters\u00a063, 51\u201355 (1997)","journal-title":"Information Processing Letters"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/BFb0029570","volume-title":"Online Algorithms","author":"J. Sgall","year":"1998","unstructured":"Sgall, J.: On-line scheduling \u2014 a survey. In: Fiat, A., Woeginger, G.J. (eds.) Dagstuhl Seminar 1996. LNCS, vol.\u00a01442, pp. 196\u2013231. Springer, Heidelberg (1998)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Skutella, M., Verschae, J.: A robust PTAS for machine covering and packing. Technical Report 011-2010, Technische Universit\u00e4t Berlin (2010), http:\/\/www.math.tu-berlin.de\/coga\/publications\/techreports\/2010\/Report-011-2010.xhtml","DOI":"10.1007\/978-3-642-15775-2_4"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.2000.1074","volume":"35","author":"J. Westbrook","year":"2000","unstructured":"Westbrook, J.: Load balancing for response time. Journal of Algorithms\u00a035, 1\u201316 (2000)","journal-title":"Journal of Algorithms"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0167-6377(96)00055-7","volume":"20","author":"G.J. Woeginger","year":"1997","unstructured":"Woeginger, G.J.: A polynomial-time approximation scheme for maximizing the minimum machine completion time. Operations Research Letters\u00a020, 149\u2013154 (1997)","journal-title":"Operations Research Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15775-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T00:17:36Z","timestamp":1559521056000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15775-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157745","9783642157752"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15775-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}