Pages that link to "Item:Q2003584"
From MaRDI portal
The following pages link to Computing lower bounds for minimum sum coloring and optimum cost chromatic partition (Q2003584):
Displaying 6 items.
- A branch-and-price algorithm for the minimum sum coloring problem (Q1983110) (← links)
- Minimum sum coloring problem: upper bounds for the chromatic strength (Q2410252) (← links)
- A short proof of the NP-completeness of minimum sum interval coloring (Q2488233) (← links)
- Lower bounds for the minimal sum coloring problem (Q2883634) (← links)
- Between Colorings and Layouts - Minimum Morphism Cost Problems (Q3439587) (← links)
- On the approximation of Min Split-coloring and Min Cocoloring (Q5301394) (← links)