{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:39:57Z","timestamp":1725896397225},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642102165"},{"type":"electronic","value":"9783642102172"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10217-2_11","type":"book-chapter","created":{"date-parts":[[2009,11,9]],"date-time":"2009-11-09T15:52:03Z","timestamp":1257781923000},"page":"83-94","source":"Crossref","is-referenced-by-count":0,"title":["Approximating the Max Edge-Coloring Problem"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Bourgeois","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giorgio","family":"Lucarelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioannis","family":"Milis","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":"11_CR1","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1109\/FOCS.2006.41","volume-title":"47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006)","author":"A. Bj\u00f6rklund","year":"2006","unstructured":"Bj\u00f6rklund, A., Husfeldt, T.: Inclusion\u2013exclusion algorithms for counting set partitions. In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 575\u2013582. IEEE Computer Society, Los Alamitos (2006)"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s004930170002","volume":"21","author":"R. Cole","year":"2001","unstructured":"Cole, R., Ost, K., Schirra, S.: Edge-coloring bipartite multigraphs in O(E logD) time. Combinatorica\u00a021, 5\u201312 (2001)","journal-title":"Combinatorica"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1016\/j.dam.2008.06.013","volume":"157","author":"D. Werra de","year":"2009","unstructured":"de Werra, D., Demange, M., Escoffier, B., Monnot, J., Paschos, V.T.: Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. Discrete Applied Mathematics\u00a0157, 819\u2013832 (2009)","journal-title":"Discrete Applied Mathematics"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0166-218X(95)00055-V","volume":"68","author":"D. Werra de","year":"1996","unstructured":"de Werra, D., Hoffman, A.J., Mahadev, N.V.R., Peled, U.N.: Restrictions and preassignments in preemptive open shop scheduling. Discrete Applied Mathematics\u00a068, 169\u2013188 (1996)","journal-title":"Discrete Applied Mathematics"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10951-006-0003-7","volume":"10","author":"M. Demange","year":"2007","unstructured":"Demange, M., de Werra, D., Monnot, J., Paschos, V.T.: Time slot scheduling of compatible jobs. Journal of Scheduling\u00a010, 111\u2013127 (2007)","journal-title":"Journal of Scheduling"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-540-77918-6_12","volume-title":"Approximation and Online Algorithms","author":"L. Epstein","year":"2008","unstructured":"Epstein, L., Levin, A.: On the max coloring problem. In: Kaklamanis, C., Skutella, M. (eds.) WAOA 2007. LNCS, vol.\u00a04927, pp. 142\u2013155. Springer, Heidelberg (2008)"},{"key":"11_CR7","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.ipl.2005.09.013","volume":"97","author":"B. Escoffier","year":"2006","unstructured":"Escoffier, B., Monnot, J., Paschos, V.T.: Weighted coloring: further complexity and approximability results. Information Processing Letters\u00a097, 98\u2013103 (2006)","journal-title":"Information Processing Letters"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I. Holyer","year":"1981","unstructured":"Holyer, I.: The NP-completeness of edge-coloring. SIAM Journal on Computing\u00a010, 718\u2013720 (1981)","journal-title":"SIAM Journal on Computing"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"1212","DOI":"10.1109\/TCOMM.2007.898848","volume":"55","author":"A. Kesselman","year":"2007","unstructured":"Kesselman, A., Kogan, K.: Nonpreemptive scheduling of optical switches. IEEE Transactions on Communications\u00a055, 1212\u20131219 (2007)","journal-title":"IEEE Transactions on Communications"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/BF01456961","volume":"77","author":"D. K\u00f6nig","year":"1916","unstructured":"K\u00f6nig, D.: \u00dcber graphen und ihre anwendung auf determinantentheorie und mengenlehre. Mathematische Annalen\u00a077, 453\u2013465 (1916)","journal-title":"Mathematische Annalen"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0166-218X(92)90202-L","volume":"36","author":"M. Kubale","year":"1992","unstructured":"Kubale, M.: Some results concerning the complexity of restricted colorings of graphs. Discrete Applied Mathematics\u00a036, 35\u201346 (1992)","journal-title":"Discrete Applied Mathematics"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-540-93980-1_22","volume-title":"Approximation and Online Algorithms","author":"G. Lucarelli","year":"2009","unstructured":"Lucarelli, G., Milis, I., Paschos, V.T.: On the maximum edge coloring problem. In: Bampis, E., Skutella, M. (eds.) WAOA 2008. LNCS, vol.\u00a05426, pp. 279\u2013292. Springer, Heidelberg (2009)"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Lucarelli, G., Milis, I., Paschos, V.T.: On the max-weight edge coloring problem. Journal of Combinatorial Optimization (in press)","DOI":"10.1007\/s10878-009-9223-z"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/SFCS.1980.12","volume-title":"21st Annual IEEE Symposium on Foundations of Computer Science (FOCS 1980)","author":"S. Micali","year":"1980","unstructured":"Micali, S., Vazirani, V.V.: An \n                    \n                      \n                    \n                    ${O(\\sqrt{|V|}|E|)}$\n                   algorithm for finding maximum matching in general graphs. In: 21st Annual IEEE Symposium on Foundations of Computer Science (FOCS 1980), pp. 17\u201327. IEEE Computer Society, Los Alamitos (1980)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1064","DOI":"10.1007\/11523468_86","volume-title":"Automata, Languages and Programming","author":"S.V. Pemmaraju","year":"2005","unstructured":"Pemmaraju, S.V., Raman, R.: Approximation algorithms for the max-coloring problem. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1064\u20131075. Springer, Heidelberg (2005)"},{"key":"11_CR16","unstructured":"Pemmaraju, S.V., Raman, R., Varadarajan, K.R.: Buffer minimization using max-coloring. In: 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pp. 562\u2013571 (2004)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10217-2_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:34:26Z","timestamp":1619782466000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10217-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642102165","9783642102172"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10217-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}