The following pages link to On the max coloring problem (Q690449):
Displaying 4 items.
- Max-coloring paths: tight bounds and extensions (Q454245) (← links)
- Clique clustering yields a PTAS for max-coloring interval graphs (Q722535) (← links)
- Capacitated max-batching with interval graph compatibilities (Q899311) (← links)
- Improved bounds for randomized preemptive online matching (Q1706142) (← links)