Pages that link to "Item:Q4943070"
From MaRDI portal
The following pages link to Approximation Results for the Optimum Cost Chromatic Partition Problem (Q4943070):
Displaying 21 items.
- Minimum cost homomorphism dichotomy for oriented cycles (Q844220) (← links)
- The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops (Q968147) (← links)
- Minimum entropy coloring (Q1016051) (← links)
- On a graph partition problem with application to VLSI layout (Q1199941) (← links)
- Hybrid evolutionary search for the minimum sum coloring problem of graphs (Q1615675) (← links)
- An effective heuristic algorithm for sum coloring of graphs (Q1762148) (← links)
- The maximum saving partition problem (Q1779697) (← links)
- Sum coloring and interval graphs: A tight upper bound for the minimum number of colors (Q1827686) (← links)
- Approximating minimum cocolorings. (Q1853153) (← links)
- A note on polynomial algorithm for cost coloring of bipartite graphs with \(\Delta \leq 4\) (Q2175244) (← links)
- Minimum sum coloring problem: upper bounds for the chromatic strength (Q2410252) (← links)
- A dichotomy for minimum cost graph homomorphisms (Q2427539) (← links)
- On sum edge-coloring of regular, bipartite and split graphs (Q2448910) (← links)
- Minimum sum multicoloring on the edges of trees (Q2503344) (← links)
- Lower bounds for the minimal sum coloring problem (Q2883634) (← links)
- Minimum Cost Homomorphism Dichotomy for Oriented Cycles (Q3511431) (← links)
- (Q5091252) (← links)
- A heuristic for the minimum cost chromatic partition problem (Q5109809) (← links)
- Minimum Cost Homomorphisms to Reflexive Digraphs (Q5458527) (← links)
- “Rent-or-Buy” Scheduling and Cost Coloring Problems (Q5458824) (← links)
- Complexity and online algorithms for minimum skyline coloring of intervals (Q5919565) (← links)
