{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:43:30Z","timestamp":1725515010580},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540728689"},{"type":"electronic","value":"9783540728702"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72870-2_3","type":"book-chapter","created":{"date-parts":[[2007,6,25]],"date-time":"2007-06-25T12:53:10Z","timestamp":1182775990000},"page":"27-36","source":"Crossref","is-referenced-by-count":2,"title":["An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs"],"prefix":"10.1007","author":[{"given":"Zhi-Zhong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Ruka","family":"Tanahashi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","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":"3_CR2","unstructured":"Hartvigsen, D.: Extensions of Matching Theory. Ph.D. Thesis, Carnegie-Mellon University (1984)"},{"key":"3_CR3","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":"3_CR4","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":"3_CR5","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":"3_CR6","unstructured":"Kosowski, A., Malafiejski, M., Zylinski, P.: Packing Edge Covers in Graphs of Small Degree. Manuscript (2006)"},{"key":"3_CR7","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":"3_CR8","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":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72870-2_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:07:17Z","timestamp":1605762437000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72870-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540728689","9783540728702"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72870-2_3","relation":{},"subject":[]}}