Pages that link to "Item:Q639285"
From MaRDI portal
The following pages link to Approximation algorithms for the interval constrained coloring problem (Q639285):
Displaying 8 items.
- The interval constrained 3-coloring problem (Q500992) (← links)
- Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring (Q533417) (← links)
- An approximation result for the interval coloring problem on claw-free chordal graphs (Q1613366) (← links)
- On the approximability of the maximum interval constrained coloring problem (Q1662109) (← links)
- Approximation Algorithms for Bounded Color Matchings via Convex Decompositions (Q2922649) (← links)
- An Approximation Algorithm for the Smallest Color-Spanning Circle Problem (Q3196382) (← links)
- Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs (Q3638867) (← links)
- Algorithms - ESA 2003 (Q5897278) (← links)