Clique clustering yields a PTAS for max-coloring interval graphs (Q722535)
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: Clique clustering yields a PTAS for max-coloring interval graphs |
scientific article; zbMATH DE number 6911194
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Clique clustering yields a PTAS for max-coloring interval graphs |
scientific article; zbMATH DE number 6911194 |
Statements
Clique clustering yields a PTAS for max-coloring interval graphs (English)
0 references
26 July 2018
0 references
combinatorial optimization
0 references
approximation algorithms
0 references
approximation schemes
0 references
graph algorithms
0 references
interval graphs
0 references
0 references
1.0000005
0 references
0.8981059
0 references
0.89183116
0 references
0.8867049
0 references
0 references
0 references
0.8805556
0 references
0.87972975
0 references
0 references
0.87683994
0 references
