The following pages link to On the Max Coloring Problem (Q5443379):
Displaying 7 items.
- Online unit clustering: Variations on a theme (Q954982) (← links)
- Approximating the max-edge-coloring problem (Q986540) (← links)
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (Q1028481) (← links)
- Clique partitioning with value-monotone submodular cost (Q2339847) (← links)
- Bounded max-colorings of graphs (Q2447538) (← links)
- Clique Clustering Yields a PTAS for max-Coloring Interval Graphs (Q3012804) (← links)
- Batch Coloring Flat Graphs and Thin (Q3512459) (← links)
