Approximation of knapsack problems with conflict and forcing graphs (Q2012887)
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 6756023
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation of knapsack problems with conflict and forcing graphs |
scientific article; zbMATH DE number 6756023 |
Statements
Approximation of knapsack problems with conflict and forcing graphs (English)
0 references
3 August 2017
0 references
knapsack problem
0 references
conflict graph
0 references
weakly chordal graph
0 references
planar graph
0 references
graph decomposition
0 references
0 references
0 references
0 references
0.8953606486320496
0 references
0.8845760226249695
0 references
0.8147003650665283
0 references
0.796195387840271
0 references
0.7949873805046082
0 references
