{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:27:27Z","timestamp":1725550047116},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291060"},{"type":"electronic","value":"9783540320241"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11560586_17","type":"book-chapter","created":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T14:08:27Z","timestamp":1129817307000},"page":"205-214","source":"Crossref","is-referenced-by-count":3,"title":["Weighted Coloring: Further Complexity and Approximability Results"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Escoffier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00f4me","family":"Monnot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vangelis Th.","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","volume-title":"Graphs and Hypergraphs.","author":"C. Berge","year":"1973","unstructured":"Berge, C.: Graphs and Hypergraphs. North-Holland, Amsterdam (1973)"},{"issue":"1-2","key":"17_CR2","first-page":"69","volume":"40","author":"M. Boudhar","year":"2000","unstructured":"Boudhar, M., Finke, G.: Scheduling on a batch machine with job compatibilities. Special issue ORBEL-14: Emerging challenges in operations research (Mons, 2000). Belg. J. Oper. Res. Statist. Comput. Sci.\u00a040(1-2), 69\u201380 (2000)","journal-title":"Special issue ORBEL-14: Emerging challenges in operations research (Mons, 2000). Belg. J. Oper. Res. Statist. Comput. Sci."},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"896","DOI":"10.1007\/978-3-540-30551-4_76","volume-title":"Algorithms and Computation","author":"D. Werra de","year":"2004","unstructured":"de Werra, D., Demange, M., Escoffier, B., Monnot, J., Paschos, V.T.: Weighted coloring on planar, bipartite and split graphs: complexity and improved approximation. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 896\u2013907. Springer, Heidelberg (2004)"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-36379-3_11","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"D. Werra de","year":"2002","unstructured":"de Werra, D., Demange, M., Monnot, J., Paschos, V.T.: Weighted node coloring: when stable sets are expensive. In: Ku\u010dera, L. (ed.) WG 2002. LNCS, vol.\u00a02573, pp. 114\u2013125. Springer, Heidelberg (2002)"},{"key":"17_CR5","unstructured":"Finke, G., Jost, V., Queyranne, M., Seb\u00f6, A., Zhu, X.: Batch Processing With Interval Graph Compatibilities Between Tasks. Cahiers du laboratoire Leibniz, 108 (2004) available at http:\/\/www-leibniz.imag.fr\/NEWLEIBNIZ\/LesCahiers\/index.xhtml"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1137\/0601025","volume":"1","author":"M.R. Garey","year":"1980","unstructured":"Garey, M.R., Johnson, D.S., Miller, G.L., Papadimitriou, C.H.: The complexity of coloring circular arcs and chords. SIAM J. Algebraic Dicrete Methods\u00a01, 216\u2013222 (1980)","journal-title":"SIAM J. Algebraic Dicrete Methods"},{"key":"17_CR7","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability. a guide to the theory of NP-completeness. Freeman, CA (1979)"},{"issue":"2","key":"17_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0020-0190(97)00002-1","volume":"61","author":"D.J. Guan","year":"1997","unstructured":"Guan, D.J., Zhu, X.: A Coloring Problem for Weighted Graphs. Inf. Process. Lett.\u00a061(2), 77\u201381 (1997)","journal-title":"Inf. Process. Lett."},{"key":"17_CR9","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)"},{"key":"17_CR10","unstructured":"Grotzsch, H.: Ein dreifarbensatz fur dreikreisfreie netze auf der kugel, Wiss. Z. Martin Luther Univ. Halle-Wittenberg, Math. Naturwiss Reihe 8, 109-120 (1959)"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0166-218X(96)00085-6","volume":"75","author":"K. Jansen","year":"1997","unstructured":"Jansen, K., Scheffler, P.: Generalized coloring for tree-like graphs. Discrete Applied Mathematics\u00a075, 135\u2013155 (1997)","journal-title":"Discrete Applied Mathematics"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/BF01456961","volume":"77","author":"D. K\u00f6nig","year":"1916","unstructured":"K\u00f6nig, D.: Ber graphen und iher anwendung auf determinantentheorie und mengenlehre. Math. Ann.\u00a077, 453\u2013465 (1916)","journal-title":"Math. Ann."},{"issue":"3","key":"17_CR13","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0166-218X(94)90150-3","volume":"50","author":"J. Kratochvl","year":"1994","unstructured":"Kratochvl, J., Tuza, Z.: Algorithmic complexity of list colorings. Discrete Applied Mathematics\u00a050(3), 297\u2013302 (1994)","journal-title":"Discrete Applied Mathematics"},{"key":"17_CR14","unstructured":"Pemmaraju, S.V., Raman, R., Varadarajan, K.R.: Buffer minimization using max-coloring. In: SODA, pp. 562\u2013571 (2004)"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Pemmaraju, S.V., Raman, R.: Approximation algorithms for the max-coloring. In: ICALP (2005) (to appear)","DOI":"10.1007\/11523468_86"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11560586_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:50:33Z","timestamp":1605642633000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11560586_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291060","9783540320241"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11560586_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}