{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:04Z","timestamp":1759638844423},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401633"},{"type":"electronic","value":"9783642401640"}],"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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40164-0_18","type":"book-chapter","created":{"date-parts":[[2013,7,21]],"date-time":"2013-07-21T21:01:30Z","timestamp":1374440490000},"page":"171-182","source":"Crossref","is-referenced-by-count":5,"title":["The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design"],"prefix":"10.1007","author":[{"given":"Laurent","family":"Gourv\u00e8s","sequence":"first","affiliation":[]},{"given":"J\u00e9r\u00f4me","family":"Monnot","sequence":"additional","affiliation":[]},{"given":"Aris T.","family":"Pagourtzis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0890-5401(03)00060-9","volume":"184","author":"E.M. Arkin","year":"2003","unstructured":"Arkin, E.M., Bender, M.A., Mitchell, J.S.B., Skiena, S.: The lazy bureaucrat scheduling problem. Inf. Comput.\u00a0184, 129\u2013146 (2003)","journal-title":"Inf. Comput."},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-540-45078-8_6","volume-title":"Algorithms and Data Structures","author":"B. Esfahbod","year":"2003","unstructured":"Esfahbod, B., Ghodsi, M., Sharifi, A.: Common-deadline lazy bureaucrat scheduling problems. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol.\u00a02748, pp. 59\u201366. Springer, Heidelberg (2003)"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10878-007-9076-2","volume":"15","author":"L. Gai","year":"2008","unstructured":"Gai, L., Zhang, G.: On lazy bureaucrat scheduling with common deadlines. J. Comb. Optim.\u00a015, 191\u2013199 (2008)","journal-title":"J. Comb. Optim."},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/3-540-45471-3_5","volume-title":"Algorithm Theory - SWAT 2002","author":"C. Hepner","year":"2002","unstructured":"Hepner, C., Stein, C.: Minimizing makespan for the lazy bureaucrat problem. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol.\u00a02368, pp. 40\u201350. Springer, Heidelberg (2002)"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/11809678_36","volume-title":"Computing and Combinatorics","author":"M. Lin","year":"2006","unstructured":"Lin, M., Yang, Y., Xu, J.: On lazy bin covering and packing problems. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol.\u00a04112, pp. 340\u2013349. Springer, Heidelberg (2006)"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/11940128_57","volume-title":"Algorithms and Computation","author":"M. Lin","year":"2006","unstructured":"Lin, M., Yang, Y., Xu, J.: Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol.\u00a04288, pp. 567\u2013577. Springer, Heidelberg (2006)"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.ipl.2008.08.005","volume":"109","author":"L. Epstein","year":"2008","unstructured":"Epstein, L., Levin, A.: Asymptotic fully polynomial approximation schemes for variants of open-end bin packing. Inf. Process. Lett.\u00a0109, 32\u201337 (2008)","journal-title":"Inf. Process. Lett."},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.orl.2008.12.007","volume":"37","author":"L. Gai","year":"2009","unstructured":"Gai, L., Zhang, G.: Hardness of lazy packing and covering. Oper. Res. Lett.\u00a037, 89\u201392 (2009)","journal-title":"Oper. Res. Lett."},{"key":"18_CR9","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. The MIT Press (2009)"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-540-73545-8_20","volume-title":"Computing and Combinatorics","author":"G. Christodoulou","year":"2007","unstructured":"Christodoulou, G., Gourv\u00e8s, L., Pascual, F.: Scheduling selfish tasks: About the performance of truthful algorithms. In: Lin, G. (ed.) COCOON 2007. LNCS, vol.\u00a04598, pp. 187\u2013197. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40164-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T22:04:55Z","timestamp":1558303495000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40164-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401633","9783642401640"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40164-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}