Convex recoloring of paths
DOI10.1016/J.ENDM.2011.05.029zbMATH Open1268.05142OpenAlexW2036848684MaRDI QIDQ2840702FDOQ2840702
Authors: Karla Roberta Lima, Yoshiko Wakabayashi 
Publication date: 23 July 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2011.05.029
Recommendations
approximation algorithmconvex coloringconvex recoloring problemCRPconvex recoloring on pathsinteger linear formulation
Approximation algorithms (68W25) Integer programming (90C10) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)
Cites Work
- Efficient approximation of convex recolorings
- Connected Coloring Completion for General Graphs: Algorithms and Complexity
- Convex Recoloring Revisited: Complexity and Exact Algorithms
- Convex recolorings of strings and trees: Definitions, hardness results and algorithms
- The Complexity of Minimum Convex Coloring
- Approximation and Online Algorithms
Cited In (11)
- The convex recoloring problem: polyhedra, facets and computational experiments
- Convex Recoloring Revisited: Complexity and Exact Algorithms
- Quadratic kernelization for convex recoloring of trees
- Convex recoloring of paths
- Quadratic Kernelization for Convex Recoloring of Trees
- 1.5-approximation algorithm for the 2-convex recoloring problem
- 1.5-approximation algorithm for the 2-convex recoloring problem
- STACS 2004
- An extended formulation of the convex recoloring problem on a tree
- Strong inequalities and a branch-and-price algorithm for the convex recoloring problem
- Column generation approach to the convex recoloring problem on a tree
This page was built for publication: Convex recoloring of paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840702)
