Approximating the Quadratic Knapsack Problem on Special Graph Classes (Q3188866): 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.1007/978-3-319-08001-7_6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W968734414 / rank | |||
Normal rank | |||
Latest revision as of 18:58, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the Quadratic Knapsack Problem on Special Graph Classes |
scientific article |
Statements
Approximating the Quadratic Knapsack Problem on Special Graph Classes (English)
0 references
2 September 2014
0 references
quadratic knapsack problem
0 references
densest \(k\)-subgraph
0 references
approximation algorithm
0 references
\(H\)-minor free
0 references
