{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:47:16Z","timestamp":1725558436299},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137303"},{"type":"electronic","value":"9783642137310"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-13731-0_37","type":"book-chapter","created":{"date-parts":[[2010,6,10]],"date-time":"2010-06-10T11:00:50Z","timestamp":1276167650000},"page":"395-407","source":"Crossref","is-referenced-by-count":1,"title":["Approximating the Maximum 3- and 4-Edge-Colorable Subgraph"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Kami\u0144ski","sequence":"first","affiliation":[]},{"given":"\u0141ukasz","family":"Kowalik","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-3","key":"37_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0012-365X(94)00254-G","volume":"148","author":"M.O. Albertson","year":"1996","unstructured":"Albertson, M.O., Haas, R.: Parsimonious edge coloring. Discrete Mathematics\u00a0148(1-3), 1\u20137 (1996)","journal-title":"Discrete Mathematics"},{"issue":"45","key":"37_CR2","doi-asserted-by":"publisher","first-page":"4543","DOI":"10.1016\/j.tcs.2009.07.008","volume":"410","author":"Z.Z. Chen","year":"2009","unstructured":"Chen, Z.Z., Tanahashi, R.: Approximating maximum edge 2-coloring in simple graphs via local improvement. Theor. Comput. Sci.\u00a0410(45), 4543\u20134553 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"37_CR3","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.jda.2007.08.002","volume":"6","author":"Z.Z. Chen","year":"2008","unstructured":"Chen, Z.Z., Tanahashi, R., Wang, L.: An improved approximation algorithm for maximum edge 2-coloring in simple graphs. J. Discrete Algorithms\u00a06(2), 205\u2013215 (2008)","journal-title":"J. Discrete Algorithms"},{"key":"37_CR4","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0012-365X(80)90002-3","volume":"29","author":"G. Cornu\u00e9jols","year":"1980","unstructured":"Cornu\u00e9jols, G., Pulleyblank, W.: A matching problem with side conditions. Discrete Mathematics\u00a029, 135\u2013159 (1980)","journal-title":"Discrete Mathematics"},{"key":"37_CR5","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/978-3-642-14279-6_7","volume-title":"Graph Theory","author":"Reinhard Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory, Electronic edn. Springer, Heidelberg (2005)"},{"key":"37_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/3-540-45753-4_11","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"U. Feige","year":"2002","unstructured":"Feige, U., Ofek, E., Wieder, U.: Approximating maximum edge coloring in multigraphs. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol.\u00a02462, pp. 108\u2013121. Springer, Heidelberg (2002)"},{"key":"37_CR7","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":"37_CR8","doi-asserted-by":"publisher","first-page":"3593","DOI":"10.1016\/j.dam.2009.04.002","volume":"157","author":"A. Kosowski","year":"2009","unstructured":"Kosowski, A.: Approximating the maximum 2\u2009\u2212 and 3\u2009\u2212edge-colorable subgraph problems. Discrete Applied Mathematics\u00a0157, 3593\u20133600 (2009)","journal-title":"Discrete Applied Mathematics"},{"key":"37_CR9","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0196-6774(83)90032-9","volume":"4","author":"D. Leven","year":"1983","unstructured":"Leven, D., Galil, Z.: NP-completeness of finding the chromatic index of regular graphs. Journal of Algorithms\u00a04, 35\u201344 (1983)","journal-title":"Journal of Algorithms"},{"key":"37_CR10","doi-asserted-by":"publisher","first-page":"4166","DOI":"10.1016\/j.disc.2008.11.017","volume":"309","author":"R. Rizzi","year":"2009","unstructured":"Rizzi, R.: Approximating the maximum 3-edge-colorable subgraph problem. Discrete Mathematics\u00a0309, 4166\u20134170 (2009)","journal-title":"Discrete Mathematics"},{"issue":"2","key":"37_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1361192.1361198","volume":"4","author":"P. Sanders","year":"2008","unstructured":"Sanders, P., Steurer, D.: An asymptotic approximation scheme for multigraph edge coloring. ACM Trans. Algorithms\u00a04(2), 1\u201324 (2008)","journal-title":"ACM Trans. Algorithms"},{"key":"37_CR12","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Heidelberg (2003)"},{"key":"37_CR13","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1002\/sapm1949281148","volume":"28","author":"C.E. Shannon","year":"1949","unstructured":"Shannon, C.E.: A theorem on coloring the lines of a network. J. Math. Phys.\u00a028, 148\u2013151 (1949)","journal-title":"J. Math. Phys."},{"key":"37_CR14","first-page":"25","volume":"3","author":"V.G. Vizing","year":"1964","unstructured":"Vizing, V.G.: On the estimate of the chromatic class of a p-graph. Diskret. Analiz\u00a03, 25\u201330 (1964)","journal-title":"Diskret. Analiz"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2010"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13731-0_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T02:42:00Z","timestamp":1578537720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13731-0_37"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137303","9783642137310"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13731-0_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}