Pages that link to "Item:Q2446103"
From MaRDI portal
The following pages link to Hardness and inapproximability of convex recoloring problems (Q2446103):
Displaying 14 items.
- The convex recoloring problem: polyhedra, facets and computational experiments (Q263202) (← links)
- The complexity of minimum convex coloring (Q415283) (← links)
- The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles (Q497683) (← links)
- 1.5-approximation algorithm for the 2-convex recoloring problem (Q1647830) (← links)
- Strong intractability results for generalized convex recoloring problems (Q2184691) (← links)
- A \(2^{O(k)}\)poly\((n)\) algorithm for the parameterized convex recoloring problem (Q2379996) (← links)
- Strong intractability of generalized convex recoloring problems (Q2413156) (← links)
- On the complexity of restoring corrupted colorings (Q2424718) (← links)
- Efficient approximation of convex recolorings (Q2643731) (← links)
- Spy game: FPT-algorithm, hardness and graph products (Q2672629) (← links)
- Strong inequalities and a branch-and-price algorithm for the convex recoloring problem (Q2673556) (← links)
- Spy game: FPT-algorithm and results on graph products (Q2695339) (← links)
- Conditional Hardness for Approximate Coloring (Q3575151) (← links)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479370) (← links)