Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (Q5918330): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 06:40, 5 March 2024
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