{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:39:08Z","timestamp":1725557948867},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642143540"},{"type":"electronic","value":"9783642143557"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14355-7_9","type":"book-chapter","created":{"date-parts":[[2010,6,23]],"date-time":"2010-06-23T09:34:40Z","timestamp":1277285680000},"page":"78-89","source":"Crossref","is-referenced-by-count":1,"title":["Approximating Maximum Edge 2-Coloring in Simple Graphs"],"prefix":"10.1007","author":[{"given":"Zhi-Zhong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Sayuri","family":"Konno","sequence":"additional","affiliation":[]},{"given":"Yuki","family":"Matsushita","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","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. Theoretical Computer Science (special issue on AAIM 2008)\u00a0410, 4543\u20134553 (2009)","journal-title":"Theoretical Computer Science (special issue on AAIM 2008)"},{"key":"9_CR2","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. Journal of Discrete Algorithms\u00a06, 205\u2013215 (2008)","journal-title":"Journal of Discrete Algorithms"},{"key":"9_CR3","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":"9_CR4","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1145\/800061.808776","volume-title":"Proceedings of the 15th Annual ACM Symposium on Theory of Computing (STOC 1983)","author":"H. Gabow","year":"1983","unstructured":"Gabow, H.: An Efficient Reduction Technique for Degree-Constrained Subgraph and Bidirected Network Flow Problems. In: Proceedings of the 15th Annual ACM Symposium on Theory of Computing (STOC 1983), pp. 448\u2013456. ACM, New York (1983)"},{"key":"9_CR5","unstructured":"Hartvigsen, D.: Extensions of Matching Theory. Ph.D. Thesis, Carnegie-Mellon University (1984)"},{"key":"9_CR6","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"D. Hochbaum","year":"1997","unstructured":"Hochbaum, D.: Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston (1997)"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1006\/jagm.2000.1121","volume":"37","author":"D.P. Jacobs","year":"2000","unstructured":"Jacobs, D.P., Jamison, R.E.: Complexity of Recognizing Equal Unions in Families of Sets. Journal of Algorithms\u00a037, 495\u2013504 (2000)","journal-title":"Journal of Algorithms"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1002\/jgt.10022","volume":"39","author":"K. Kawarabayashi","year":"2002","unstructured":"Kawarabayashi, K., Matsuda, H., Oda, Y., Ota, K.: Path Factors in Cubic Graphs. Journal of Graph Theory\u00a039, 188\u2013193 (2002)","journal-title":"Journal of Graph Theory"},{"key":"9_CR9","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- and 3-Edge-Colorable Subgraph Problems. Discrete Applied Mathematics\u00a0157, 3593\u20133600 (2009)","journal-title":"Discrete Applied Mathematics"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10878-006-9034-4","volume":"14","author":"A. Kosowski","year":"2007","unstructured":"Kosowski, A., Malafiejski, M., Zylinski, P.: Packing [1,\u0394]-Factors in Graphs of Small Degree. Journal of Combinatorial Optimization\u00a014, 63\u201386 (2007)","journal-title":"Journal of Combinatorial Optimization"},{"key":"9_CR11","volume-title":"Art Gallery Theorems and Algorithms","author":"J. O\u2019Rourke","year":"1987","unstructured":"O\u2019Rourke, J.: Art Gallery Theorems and Algorithms. Oxford University Press, Oxford (1987)"},{"key":"9_CR12","volume-title":"Handbook on Computational Geometry","author":"J. Urrutia","year":"2000","unstructured":"Urrutia, J.: Art Gallery and Illumination Problems. In: Handbook on Computational Geometry. Elsevier Science, Amsterdam (2000)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14355-7_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T08:25:15Z","timestamp":1619771115000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14355-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642143540","9783642143557"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14355-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}