Pages that link to "Item:Q1662109"
From MaRDI portal
The following pages link to On the approximability of the maximum interval constrained coloring problem (Q1662109):
Displaying 7 items.
- The interval constrained 3-coloring problem (Q500992) (← links)
- Approximation algorithms for the interval constrained coloring problem (Q639285) (← links)
- An approximation result for the interval coloring problem on claw-free chordal graphs (Q1613366) (← links)
- Saving colors and max coloring: some fixed-parameter tractability results (Q1755584) (← links)
- Optimal bounds for the colored Tverberg problem (Q2344495) (← links)
- A short proof of the NP-completeness of minimum sum interval coloring (Q2488233) (← links)
- The maximum feasible subset problem (maxFS) and applications (Q5884385) (← links)