A note on the set union knapsack problem (Q2449074): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2013.12.015 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2021083959 / rank | |||
Normal rank | |||
Revision as of 02:24, 20 March 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
