Weighted coloring: further complexity and approximability results (Q1045908)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Weighted coloring: further complexity and approximability results |
scientific article; zbMATH DE number 5650179
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Weighted coloring: further complexity and approximability results |
scientific article; zbMATH DE number 5650179 |
Statements
Weighted coloring: further complexity and approximability results (English)
0 references
18 December 2009
0 references
approximation algorithms
0 references
NP-complete problems
0 references
weighted coloring
0 references
interval graphs
0 references
line graph of bipartite graphs
0 references
partial \(k\)-tree
0 references
0.9975178241729736
0 references
0.8357968330383301
0 references
0.8346373438835144
0 references
