A note on the set union knapsack problem (Q2449074): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 23:14, 2 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on the set union knapsack problem |
scientific article |
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