A note on the set union knapsack problem (Q2449074)
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 6292389
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the set union knapsack problem |
scientific article; zbMATH DE number 6292389 |
Statements
A note on the set union knapsack problem (English)
0 references
6 May 2014
0 references
approximation
0 references
densest \(k\)-subgraph
0 references
set-union knapsack
0 references
greedy
0 references
0.8139954805374146
0 references
0.79063880443573
0 references
0.7712263464927673
0 references
