Approximation and hardness results for the maximum edge \(q\)-coloring problem (Q350721): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q17 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68W25 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6662312 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
hardness of approximation | |||
| Property / zbMATH Keywords: hardness of approximation / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
approximation algorithms | |||
| Property / zbMATH Keywords: approximation algorithms / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
graph coloring | |||
| Property / zbMATH Keywords: graph coloring / rank | |||
Normal rank | |||
Revision as of 08:19, 28 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation and hardness results for the maximum edge \(q\)-coloring problem |
scientific article |
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
