Strong inequalities and a branch-and-price algorithm for the convex recoloring problem
From MaRDI portal
(Redirected from Publication:2673556)
Recommendations
Cites work
- 1.5-approximation algorithm for the 2-convex recoloring problem
- A random tree model associated with random graphs
- An extended formulation of the convex recoloring problem on a tree
- Column generation approach to the convex recoloring problem on a tree
- Convex Recoloring Revisited: Complexity and Exact Algorithms
- Convex recolorings of strings and trees: Definitions, hardness results and algorithms
- Efficient approximation of convex recolorings
- Hardness and inapproximability of convex recoloring problems
- Min-cut clustering
- Strong intractability results for generalized convex recoloring problems
- The complexity of minimum convex coloring
- The convex recoloring problem: polyhedra, facets and computational experiments
Cited in
(4)
This page was built for publication: Strong inequalities and a branch-and-price algorithm for the convex recoloring problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2673556)