{"paper":{"title":"Complexity Results for Rainbow Matchings","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Florian Pfender, Van Bang Le","submitted_at":"2013-12-27T12:53:47Z","abstract_excerpt":"A rainbow matching in an edge-colored graph is a matching whose edges have distinct colors. We address the complexity issue of the following problem, \\mrbm: Given an edge-colored graph $G$, how large is the largest rainbow matching in $G$? We present several sharp contrasts in the complexity of this problem.\n  We show, among others, that \n\n* can be approximated by a polynomial algorithm with approximation ratio $2/3-\\eps$. \n* is APX-complete, even when restricted to properly edge-colored linear forests without a $5$-vertex path, and is solvable in %time $O(m^{3/2})$ on edge-colored $m$-edge po"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7253","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}