Algorithms and complexity for a class of combinatorial optimization problems with labelling (Q2031932)
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: Algorithms and complexity for a class of combinatorial optimization problems with labelling |
scientific article; zbMATH DE number 7359099
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms and complexity for a class of combinatorial optimization problems with labelling |
scientific article; zbMATH DE number 7359099 |
Statements
Algorithms and complexity for a class of combinatorial optimization problems with labelling (English)
0 references
15 June 2021
0 references
combinatorial optimization
0 references
approximation algorithm
0 references
problem labelling
0 references
sublobular cover
0 references
\(\mathcal{NP}\)-hardness
0 references
inapproximation
0 references
0 references
0 references
0.91648674
0 references
0 references
0.90792036
0 references
0.8913384
0 references
0.8905141
0 references
0.88520575
0 references
