Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (Q5918330)
From MaRDI portal
scientific article; zbMATH DE number 7367755
| 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 7367755 |
Statements
Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (English)
0 references
5 July 2021
0 references
max \(k\)-uncut
0 references
densest \(k\)-subgraph
0 references
approximation algorithm
0 references
combinatorial optimization
0 references
0 references
0 references
