An extended formulation of the convex recoloring problem on a tree

  title={An extended formulation of the convex recoloring problem on a tree},
  author={Sunil Chopra and Bartosz Filipecki and Kangbok Lee and Minseok Ryu and Sangho Shim and Mathieu Van Vyve},
  journal={Mathematical Programming},
AbstractWe introduce a strong extended formulation of the convex recoloring problem on a tree, which has an application in analyzing phylogenetic trees. The extended formulation has only a polynomial number of constraints, but dominates the conventional formulation and the exponentially many valid inequalities introduced by Campêlo et al. (Math Progr 156:303–330, 2016). We show that all valid inequalities introduced by Campêlo et al. can be derived from the extended formulation. We also show… 

Strong intractability of generalized convex recoloring problems

Polyhedral study of the Convex Recoloring problem

A full-dimensional polytope based on the idea of connected subgraphs is introduced, and a class of valid inequalities with righthand side one is presented that comprises all facet-defining inequalities with binary coefficients when the input graph is a tree.

Mixed-integer programming techniques for the connected max-k-cut problem

It turns out that the techniques from the existing literature are not sufficient to solve an adequate fraction of the test sets, but the novel techniques significantly outperform the existing ones both in terms of running times and the overall number of instances that can be solved.

Board 101 : A Steepest Edge Rule for a Column Generation Approach to the Convex Recoloring Problem

A hybrid rule combining the Dantzig’s Rule and the Steepest Edge Rule is developed to produce columns which enter into the basis of the master problem in the column generation framework introduced by Chopra et al.

A System For Motif Search In Biological Networks

In this work, we investigate an important problem from the biology field, which consists in searching for specific patterns, named motifs, in networks which represent certain biological interactions,



Convex Recoloring Revisited: Complexity and Exact Algorithms

A new look is taken at the convex path recoloring, convex tree recoloring and convex leaf recoloring problems through the eyes of the independent set problem to give a complete characterization of the complexity of all these problems in terms of the number of occurrences of each color in the input instance, and to present simpler NP-hardness proofs for them than those given earlier.

Extended formulations for the A-cut problem

It is shown that the LP-relaxations of the extended formulations are stronger than the LP -relaxation of the edge variable formulation (even with an extra class of valid inequalities added).

Partial convex recolorings of trees and galled networks: Tight upper and lower bounds

Although determining whether a coloring is convex on an arbitrary network is hard, it can be found efficiently on galled networks and a fixed parameter tractable algorithm is presented that finds the recoloring distance of such a network whose running time is quadratic in the network size and exponential in that distance.

On the Complexity of Solving or Approximating Convex Recoloring Problems

A very strong complexity result is proved showing that CR is already NP-hard on k-colored grids, and therefore also on planar graphs with maximum degree 4, and it is proved that, for a positive constant c, there is no cln n-approximation algorithm even for k- colored n-vertex bipartite graphs, unless P = NP.

Convex recolorings of strings and trees: Definitions, hardness results and algorithms

The convex recoloring problem: polyhedra, facets and computational experiments

The facial structure of the polytope defined as the convex hull of the integer points satisfying the restrictions of the proposed ILP formulation is studied, and several classes of facet-defining inequalities are presented and the corresponding separation algorithms are presented.

Improved Approximation Algorithm for Convex Recoloring of Trees

A (2+ε)-approximation algorithm for the minimum convex recoloring problem, whose running time is O(n2+n(1/ε)241/ε).

Efficient approximation of convex recolorings

Extended formulations in combinatorial optimization

This survey presents compact extended formulations for several graph problems involving cuts, trees, cycles and matchings, and for the mixing set, and presents the proof of Fiorini, Massar, Pokutta, Tiwary and de Wolf of an exponential lower bound for the cut polytope.