Pages that link to "Item:Q2488233"
From MaRDI portal
The following pages link to A short proof of the NP-completeness of minimum sum interval coloring (Q2488233):
Displaying 9 items.
- Minimum entropy combinatorial optimization problems (Q693045) (← links)
- The transportation problem with conflicts (Q829180) (← links)
- Minimum entropy coloring (Q1016051) (← links)
- On the sum coloring problem on interval graphs (Q1277392) (← links)
- Sum coloring and interval graphs: A tight upper bound for the minimum number of colors (Q1827686) (← links)
- SUB-COLORING AND HYPO-COLORING INTERVAL GRAPHS (Q3063603) (← links)
- On the approximability of time disjoint walks (Q5918517) (← links)
- Maximum cut on interval graphs of interval count four is NP-complete (Q6124829) (← links)
- Complexity of maximum cut on interval graphs (Q6174803) (← links)