Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts (Q5952050): 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.1023/a:1011620607786 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2104823067 / rank | |||
Normal rank | |||
Latest revision as of 10:54, 30 July 2024
scientific article; zbMATH DE number 1687624
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts |
scientific article; zbMATH DE number 1687624 |
Statements
Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts (English)
0 references
8 January 2002
0 references
edge weighted undirected graph
0 references
approximation algorithm
0 references
