Weighted Triangle-free 2-matching Problem with Edge-disjoint Forbidden Triangles

The weighted T-free 2-matching problem is the following problem: given an undirected graph G, a weight function on its edge set, and a set T of triangles in G, find a maximum weight 2-matching containing no triangle in T. When T is the set of all triangles in G, this problem is known as the weighted triangle-free 2-matching problem, which is a long-standing open problem. A main contribution of this paper is to give a first polynomial-time algorithm for the weighted T-free 2-matching problem under the assumption that T is a set of edge-disjoint triangles. In our algorithm, a key ingredient is to give an extended formulation representing the solution set, that is, we introduce new variables and represent the convex hull of the feasible solutions as a projection of another polytope in a higher dimensional space. Although our extended formulation has exponentially many inequalities, we show that the separation problem can be solved in polynomial time, which leads to a polynomial-time algorithm for the weighted T-free 2-matching problem.

Authors

• 20 publications
• Maximum Weight Independent Sets for (S_1,2,4,Triangle)-Free Graphs in Polynomial Time

The Maximum Weight Independent Set (MWIS) problem on finite undirected g...
06/22/2018 ∙ by Andreas Brandstädt, et al. ∙ 0

• Independent sets in (P_4+P_4,Triangle)-free graphs

The Maximum Weight Independent Set Problem (WIS) is a well-known NP-hard...
03/19/2020 ∙ by Raffaele Mosca, et al. ∙ 0

• On the Maximum Weight Independent Set Problem in graphs without induced cycles of length at least five

A hole in a graph is an induced cycle of length at least 4, and an antih...
03/12/2019 ∙ by Maria Chudnovsky, et al. ∙ 0

• A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs – via half-edges

We consider three variants of the problem of finding a maximum weight re...
12/31/2020 ∙ by Katarzyna Paluch, et al. ∙ 0

• Polygon Extraction from Triangular Meshes

This paper presents Polylidar, an efficient algorithm to extract non-con...
02/05/2020 ∙ by Jeremy Castagno, et al. ∙ 0

• Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time

We provide an efficient algorithm for computing the nucleolus for an ins...
03/08/2018 ∙ by Jochen Koenemann, et al. ∙ 0