Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (Q5919045)
From MaRDI portal
scientific article; zbMATH DE number 7285603
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph |
scientific article; zbMATH DE number 7285603 |
Statements
Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (English)
0 references
15 December 2020
0 references
max \(k\)-uncut
0 references
densest \(k\)-subgraph
0 references
approximation algorithm
0 references
LP-rounding
0 references
combinatorial optimization
0 references
0 references
0 references
0 references
0 references
