论文信息 - Column generation approach to the convex recoloring problem on a tree

Column generation approach to the convex recoloring problem on a tree

The convex recoloring (CR) problem is to recolor the nodes of a colored graph at minimum number of color changes such that each color induces a connected subgraph. We adjust to the convex recoloring problem the column generation framework developed by Johnson et al. (Math Program 62:133–151, 1993). For the convex recoloring problem on a tree, the subproblem to generate columns can be solved in polynomial time by a dynamic programming algorithm. The column generation framework solves the convex recoloring problem on a tree with a large number of colors extremely fast.

Eun-Seok Kim | Ergin Erdem | Sangho Shim | Sunil Chopra

[1] Sagi Snir,et al. Convex recolorings of strings and trees: Definitions, hardness results and algorithms , 2008, J. Comput. Syst. Sci..

[2] IV FrederickA.Matsen,et al. Reconciling taxonomy and phylogenetic inference: formalism and algorithms for describing discord and inferring taxonomic roots , 2011, Algorithms for Molecular Biology.

[3] Dieter Kratsch,et al. Convex Recoloring Revisited: Complexity and Exact Algorithms , 2009, COCOON.

[4] Eric P. Nawrocki,et al. An improved Greengenes taxonomy with explicit ranks for ecological and evolutionary analyses of bacteria and archaea , 2011, The ISME Journal.

[5] Yoshiko Wakabayashi,et al. On the Complexity of Solving or Approximating Convex Recoloring Problems , 2013, COCOON.

[6] Sagi Snir,et al. Partial convex recolorings of trees and galled networks: Tight upper and lower bounds , 2011, TALG.

[7] Yukio Taniguchi,et al. QTL/microarray approach using pathway information , 2012, Algorithms for Molecular Biology.

[8] George L. Nemhauser,et al. Min-cut clustering , 1993, Math. Program..

[9] Yoshiko Wakabayashi,et al. The convex recoloring problem: polyhedra, facets and computational experiments , 2016, Math. Program..