Pages that link to "Item:Q5479370"
From MaRDI portal
The following pages link to Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479370):
Displaying 6 items.
- The convex recoloring problem: polyhedra, facets and computational experiments (Q263202) (← links)
- Testing convexity properties of tree colorings (Q547293) (← links)
- Improved approximation algorithm for convex recoloring of trees (Q927405) (← links)
- Convex recolorings of strings and trees: Definitions, hardness results and algorithms (Q931727) (← links)
- A \(2^{O(k)}\)poly\((n)\) algorithm for the parameterized convex recoloring problem (Q2379996) (← links)
- Efficient approximation of convex recolorings (Q2643731) (← links)
