The maximum congested cut problem and its robust counterpart: Exact and approximation algorithms for the single and the multicommodity case (Q5449665)
From MaRDI portal
scientific article; zbMATH DE number 5248270
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The maximum congested cut problem and its robust counterpart: Exact and approximation algorithms for the single and the multicommodity case |
scientific article; zbMATH DE number 5248270 |
Statements
The maximum congested cut problem and its robust counterpart: Exact and approximation algorithms for the single and the multicommodity case (English)
0 references
12 March 2008
0 references
cut congestion
0 references
sparsest cut
0 references
linear fractional combinatorial optimization
0 references
0 references
