Pages that link to "Item:Q927405"

The following pages link to Improved approximation algorithm for convex recoloring of trees (Q927405):

Displaying 9 items.

• Exact exponential algorithms to find tropical connected sets of minimum size (Q527400) (← links)
• Quadratic kernelization for convex recoloring of trees (Q639283) (← links)
• Combinatorial optimization in system configuration design (Q1027725) (← links)
• 1.5-approximation algorithm for the 2-convex recoloring problem (Q1647830) (← links)
• An extended formulation of the convex recoloring problem on a tree (Q1675254) (← links)
• A GRASP for the convex recoloring problem in graphs (Q2132370) (← links)
• Hardness and inapproximability of convex recoloring problems (Q2446103) (← links)
• Convex Recoloring Revisited: Complexity and Exact Algorithms (Q5323087) (← links)
• A heuristic for the convex recoloring problem in graphs (Q6071077) (← links)