Pages that link to "Item:Q5898463"
From MaRDI portal
The following pages link to Approximation and Online Algorithms (Q5898463):
Displaying 11 items.
- The complexity of minimum convex coloring (Q415283) (← links)
- Improved approximation algorithm for convex recoloring of trees (Q927405) (← links)
- Convex recolorings of strings and trees: Definitions, hardness results and algorithms (Q931727) (← links)
- Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem (Q2102838) (← links)
- Convex recoloring of paths (Q2448880) (← links)
- Efficient approximation of convex recolorings (Q2643731) (← links)
- Convex recoloring of paths (Q2840702) (← links)
- Reconstruction for Colorings on Trees (Q3094945) (← links)
- Partial convex recolorings of trees and galled networks (Q3189026) (← links)
- Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems (Q3502673) (← links)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479370) (← links)