Approximation and hardness results for the maximum edge \(q\)-coloring problem (Q350721)
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: Approximation and hardness results for the maximum edge \(q\)-coloring problem |
scientific article; zbMATH DE number 6662312
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation and hardness results for the maximum edge \(q\)-coloring problem |
scientific article; zbMATH DE number 6662312 |
Statements
Approximation and hardness results for the maximum edge \(q\)-coloring problem (English)
0 references
9 December 2016
0 references
hardness of approximation
0 references
approximation algorithms
0 references
graph coloring
0 references
0.9999999
0 references
0.9421853
0 references
0.94079643
0 references
0.9342116
0 references
0.92428017
0 references
0.9236262
0 references
0 references
0 references
