A note on the set union knapsack problem (Q2449074): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The dense \(k\)-subgraph problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4314864 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The budgeted maximum coverage problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph expansion and the unique games conjecture / rank | |||
Normal rank |
Latest revision as of 11:25, 8 July 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