{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:59:43Z","timestamp":1725544783586},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540327554"},{"type":"electronic","value":"9783540327561"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11682462_48","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T11:50:30Z","timestamp":1140177030000},"page":"515-523","source":"Crossref","is-referenced-by-count":1,"title":["Common Deadline Lazy Bureaucrat Scheduling Revisited"],"prefix":"10.1007","author":[{"given":"Ling","family":"Gai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guochuan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"48_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.S.: The lazy bureaucrat scheduling problem. Information and Computation\u00a0184, 129\u2013146 (2003)","journal-title":"Information and Computation"},{"key":"48_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":"48_CR3","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Williamaon, D.P.: Improved approximation algorithms for maixmum cut and satisfiability problems using semidefinite programming. Journal of ACM\u00a042, 1115\u20131145 (1995)","journal-title":"Journal of ACM"},{"key":"48_CR4","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0020-0190(98)00102-1","volume":"67","author":"R. Hassin","year":"1998","unstructured":"Hassin, R., Rubinstein, S.: An approximation algorithm for the maximum traveling salesman problem. Information Processing Letter\u00a067, 125\u2013130 (1998)","journal-title":"Information Processing Letter"},{"key":"48_CR5","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":"48_CR6","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/BF02523689","volume":"18","author":"D. Karger","year":"1997","unstructured":"Karger, D., Motwani, R., Ramkumar, G.: On approximating the longest path in a graph. Algorithmica\u00a018, 82\u201398 (1997)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","LATIN 2006: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T07:46:38Z","timestamp":1552376798000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/11682462_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}