Polynomial-time approximation algorithms for the coloring problem in some cases (Q2359789): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:33, 2 February 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
