Polynomial-time approximation algorithms for the coloring problem in some cases (Q2359789): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 06:50, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-time approximation algorithms for the coloring problem in some cases |
scientific article |
Statements
Polynomial-time approximation algorithms for the coloring problem in some cases (English)
0 references
22 June 2017
0 references
coloring problem
0 references
computational complexity
0 references
approximation algorithm
0 references
performance guarantee
0 references
