{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:15:39Z","timestamp":1725470139824},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540388753"},{"type":"electronic","value":"9783540388760"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11841036_34","type":"book-chapter","created":{"date-parts":[[2006,9,11]],"date-time":"2006-09-11T13:20:54Z","timestamp":1157980854000},"page":"364-375","source":"Crossref","is-referenced-by-count":2,"title":["Graph Coloring with Rejection"],"prefix":"10.1007","author":[{"given":"Leah","family":"Epstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Asaf","family":"Levin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"34_CR1","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0020-0190(92)90209-E","volume":"44","author":"A. Bar-Noy","year":"1992","unstructured":"Bar-Noy, A., Motwani, R., Naor, J.: The greedy algorithm is optimal for on-line edge coloring. Information Processing Letters\u00a044(5), 251\u2013253 (1992)","journal-title":"Information Processing Letters"},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/0095-8956(80)90079-9","volume":"29","author":"A. Frank","year":"1980","unstructured":"Frank, A.: On chain and antichain families of a partially ordered set. Journal of Combinatorial Theory Series B\u00a029, 176\u2013184 (1980)","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"34_CR3","volume-title":"Computers and intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability. W. H. Freeman and Company, New York (1979)"},{"issue":"2","key":"34_CR4","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. SIAM J. Comput.\u00a024(2), 296\u2013317 (1995)","journal-title":"SIAM J. Comput."},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/jgt.3190120212","volume":"12","author":"A. Gy\u00e1rf\u00e1s","year":"1988","unstructured":"Gy\u00e1rf\u00e1s, A., Lehel, J.: On-line and first-fit colorings of graphs. Journal of Graph Theory\u00a012, 217\u2013227 (1988)","journal-title":"Journal of Graph Theory"},{"issue":"3","key":"34_CR6","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/0196-6774(85)90012-4","volume":"6","author":"D.S. Johnson","year":"1985","unstructured":"Johnson, D.S.: The NP-completeness column: an ongoing guide. Journal of Algorithms\u00a06(3), 434\u2013451 (1985)","journal-title":"Journal of Algorithms"},{"key":"34_CR7","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BFb0029574","volume-title":"Online Algorithms - The State of the Art, Ch. 13","author":"H.A. Kierstead","year":"1998","unstructured":"Kierstead, H.A.: Coloring graphs on-line. In: Fiat, A., Woeginger, G.J. (eds.) Online Algorithms - The State of the Art, ch. 13, pp. 281\u2013305. Springer, Berlin (1998)"},{"key":"34_CR8","first-page":"279","volume-title":"Studies of Graphs and Discrete Programming","author":"G.L. Nemhauser","year":"1972","unstructured":"Nemhauser, G.L., Wolsey, L.: Maximizing submodular set functions: formulations and analysis of algorithms. In: Studies of Graphs and Discrete Programming, pp. 279\u2013301. North-Holland, Amsterdam (1972)"},{"key":"34_CR9","volume-title":"Combinatorial optimization polyhedra and efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial optimization polyhedra and efficiency. Springer, Heidelberg (2003)"},{"issue":"5","key":"34_CR10","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0020-0190(97)00182-8","volume":"64","author":"P. Slav\u00edk","year":"1997","unstructured":"Slav\u00edk, P.: Improved performance for the greedy algorithm for partial cover. Information Processing Letters\u00a064(5), 251\u2013254 (1997)","journal-title":"Information Processing Letters"},{"issue":"2","key":"34_CR11","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(87)90107-4","volume":"24","author":"M. Yannakakis","year":"1987","unstructured":"Yannakakis, M., Gavril, F.: The maximum k-colorable subgraph problem for chordal graphs. Information Processing Letters\u00a024(2), 133\u2013137 (1987)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11841036_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:16:53Z","timestamp":1619507813000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11841036_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540388753","9783540388760"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11841036_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}