Pages that link to "Item:Q1045908"
From MaRDI portal
The following pages link to Weighted coloring: further complexity and approximability results (Q1045908):
Displayed 11 items.
- On the max-weight edge coloring problem (Q613668) (← links)
- Approximating the max-edge-coloring problem (Q986540) (← links)
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (Q1028481) (← links)
- Models and heuristic algorithms for a weighted vertex coloring problem (Q1038841) (← links)
- Polynomial approximation: a structural and operational study. (Abstract of thesis) (Q2644383) (← links)
- A survey on vertex coloring problems (Q3002686) (← links)
- Clique Clustering Yields a PTAS for max-Coloring Interval Graphs (Q3012804) (← links)
- Batch Coloring Flat Graphs and Thin (Q3512459) (← links)
- On the Maximum Edge Coloring Problem (Q3602848) (← links)
- On the Max Coloring Problem (Q5443379) (← links)
- “Rent-or-Buy” Scheduling and Cost Coloring Problems (Q5458824) (← links)