On Approximate Solutions for Combinatorial Optimization Problems (Q3477970)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4147523
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Approximate Solutions for Combinatorial Optimization Problems |
scientific article; zbMATH DE number 4147523 |
Statements
On Approximate Solutions for Combinatorial Optimization Problems (English)
0 references
1990
0 references
reductions
0 references
NP-completeness
0 references
approximation algorithms
0 references
consistent
0 references
automata
0 references
partitioning
0 references
combinatorial optimization
0 references
graph coloring
0 references
covering
0 references
independent set
0 references
set packing
0 references
0.93808466
0 references
0.9369339
0 references
0.9320747
0 references
0.9289905
0 references
