Pages that link to "Item:Q286971"
From MaRDI portal
The following pages link to A coloring problem for weighted graphs (Q286971):
Displayed 8 items.
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (Q1028481) (← links)
- Weighted coloring: further complexity and approximability results (Q1045908) (← links)
- Minimum cost and list homomorphisms to semicomplete digraphs (Q2492190) (← links)
- Polynomial approximation: a structural and operational study. (Abstract of thesis) (Q2644383) (← links)
- Clique partitioning of interval graphs with submodular costs on the cliques (Q3004202) (← links)
- Clique Clustering Yields a PTAS for max-Coloring Interval Graphs (Q3012804) (← links)
- Batch Coloring Flat Graphs and Thin (Q3512459) (← links)
- On the Max Coloring Problem (Q5443379) (← links)