{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T01:08:45Z","timestamp":1725757725103},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319037790"},{"type":"electronic","value":"9783319037806"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03780-6_1","type":"book-chapter","created":{"date-parts":[[2013,11,21]],"date-time":"2013-11-21T06:13:18Z","timestamp":1385014398000},"page":"1-12","source":"Crossref","is-referenced-by-count":1,"title":["Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings"],"prefix":"10.1007","author":[{"given":"Zhi-Zhong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Ying","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"#cr-split#-1_CR1.1","doi-asserted-by":"crossref","unstructured":"Chen, Z.-Z., Konno, S., Matsushita, Y.: Approximating Maximum Edge 2-Coloring in Simple Graphs. Discrete Applied Mathematics\u00a0158, 1894-1901 (2010)","DOI":"10.1016\/j.dam.2010.08.010"},{"key":"#cr-split#-1_CR1.2","unstructured":"A preliminary version appeared in Chen, B. (ed.) AAIM 2010. LNCS, vol.\u00a06124, pp. 78-89. Springer, Heidelberg (2010)"},{"key":"#cr-split#-1_CR2.1","doi-asserted-by":"crossref","unstructured":"Chen, Z.-Z., Tanahashi, R.: Approximating Maximum Edge 2-Coloring in Simple Graphs via Local Improvement. AAIM 2008\u00a0410, 4543-4553 (2009)","DOI":"10.1016\/j.tcs.2009.07.008"},{"key":"#cr-split#-1_CR2.2","unstructured":"A preliminary version appeared in Fleischer, R., Xu, J. (eds.) AAIM 2008. LNCS, vol.\u00a05034, pp. 84-96. Springer, Heidelberg (2008)"},{"key":"#cr-split#-1_CR3.1","doi-asserted-by":"crossref","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-215 (2008)","DOI":"10.1016\/j.jda.2007.08.002"},{"key":"#cr-split#-1_CR3.2","unstructured":"A preliminary version appeared in Kao, M.-Y., Li, X.-Y. (eds.) AAIM 2007. LNCS, vol.\u00a04508, pp. 27-36. Springer, Heidelberg (2007)"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s10878-005-1779-7","volume":"9","author":"Z.-Z. Chen","year":"2005","unstructured":"Chen, Z.-Z., Wang, L.: An Improved Randomized Approximation Algorithm for Max TSP. Journal of Combinatorial Optimization\u00a09, 401\u2013432 (2005)","journal-title":"Journal of Combinatorial Optimization"},{"key":"1_CR5","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":"1_CR6","unstructured":"Gabow, H.: Implementation of Algorithms for Maximum Matching on Nonbipartite Graphs. Ph.D. Thesis, Department of Computer Science, Stanford University, Stanford, California (1973)"},{"key":"1_CR7","doi-asserted-by":"crossref","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 (1983)","DOI":"10.1145\/800061.808776"},{"key":"1_CR8","unstructured":"Hartvigsen, D.: Extensions of Matching Theory. Ph.D. Thesis, Carnegie-Mellon University (1984)"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0020-0190(00)00097-1","volume":"75","author":"R. Hassin","year":"2000","unstructured":"Hassin, R., Rubinstein, S.: Better Approximation for Max TSP. Information Processing Letters\u00a075, 181\u2013186 (2000)","journal-title":"Information Processing Letters"},{"key":"1_CR10","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":"1_CR11","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":"1_CR12","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":"1_CR13","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"},{"key":"1_CR14","unstructured":"Serdyukov, A.I.: An Algorithm with an Estimate for the Traveling Salesman Problem of Maximum. Upravlyaemye Sistemy\u00a025, 80\u201386 (1984) (in Russian)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03780-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T12:57:25Z","timestamp":1558702645000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03780-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319037790","9783319037806"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03780-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}