{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:26:54Z","timestamp":1726410414473},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387081"},{"type":"electronic","value":"9783642387098"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-662-44602-7_6","type":"book-chapter","created":{"date-parts":[[2014,8,23]],"date-time":"2014-08-23T01:18:40Z","timestamp":1408756720000},"page":"66-77","source":"Crossref","is-referenced-by-count":0,"title":["The Lazy Matroid Problem"],"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":"6_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":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-40164-0_18","volume-title":"Fundamentals of Computation Theory","author":"L. Gourv\u00e8s","year":"2013","unstructured":"Gourv\u00e8s, L., Monnot, J., Pagourtzis, A.T.: The lazy bureaucrat problem with common arrivals and deadlines: Approximation and mechanism design. In: G\u0105sieniec, L., Wolter, F. (eds.) FCT 2013. LNCS, vol.\u00a08070, pp. 171\u2013182. Springer, Heidelberg (2013)"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/11682462_48","volume-title":"LATIN 2006: Theoretical Informatics","author":"L. Gai","year":"2006","unstructured":"Gai, L., Zhang, G.: Common deadline lazy bureaucrat scheduling revisited. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.\u00a03887, pp. 515\u2013523. Springer, Heidelberg (2006)"},{"key":"6_CR4","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":"6_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":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-48447-7_14","volume-title":"Algorithms and Data Structures","author":"E.M. Arkin","year":"1999","unstructured":"Arkin, E.M., Bender, M.A., Mitchell, J.S.B., Skiena, S.S.: The Lazy Bureaucrat Scheduling Problem. In: Dehne, F., Gupta, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1999. LNCS, vol.\u00a01663, pp. 122\u2013133. Springer, Heidelberg (1999)"},{"key":"6_CR7","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":"6_CR8","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":"6_CR9","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0167-6377(84)90009-9","volume":"3","author":"P.M. Camerini","year":"1984","unstructured":"Camerini, P.M., Vercellis, C.: The matroidal knapsack: A class of (often) well-solvable problems. Operations Research Letters\u00a03, 157\u2013162 (1984)","journal-title":"Operations Research Letters"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0020-0190(93)90022-2","volume":"46","author":"M.M. Halld\u00f3rsson","year":"1993","unstructured":"Halld\u00f3rsson, M.M.: Approximating the minimum maximal independence number. Information Processing Letters\u00a046, 169\u2013172 (1993)","journal-title":"Information Processing Letters"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"1264","DOI":"10.1016\/j.ic.2008.07.003","volume":"206","author":"M. Chleb\u00edk","year":"2008","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: Approximation hardness of dominating set problems in bounded degree graphs. Inf. Comput.\u00a0206, 1264\u20131275 (2008)","journal-title":"Inf. Comput."},{"key":"6_CR12","unstructured":"Oxley, J.G.: Matroid Theory. Oxford University Press (1992)"},{"key":"6_CR13","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Heidelberg (2003)"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1017\/S000497270004140X","volume":"1","author":"R. Brualdi","year":"1969","unstructured":"Brualdi, R.: Comments on bases in different structures. Bull. Austral. Math. Soc.\u00a01, 161\u2013167 (1969)","journal-title":"Bull. Austral. Math. Soc."},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(98)00147-4","volume":"91","author":"D.F. Manlove","year":"1999","unstructured":"Manlove, D.F.: On the algorithmic complexity of twelve covering and independence parameters of graphs. Discrete Applied Mathematics\u00a091, 155\u2013175 (1999)","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes (extended abstract). In: Simon, J. (ed.) STOC, pp. 229\u2013234. ACM (1988)","DOI":"10.1145\/62212.62233"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P. Alimonti","year":"2000","unstructured":"Alimonti, P., Kann, V.: Some apx-completeness results for cubic graphs. Theor. Comput. Sci.\u00a0237, 123\u2013134 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR18","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)"}],"container-title":["Lecture Notes in Computer Science","Advanced Information Systems Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44602-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T17:14:14Z","timestamp":1558977254000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44602-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642387081","9783642387098"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44602-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}