Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts (Q4302277)
From MaRDI portal
scientific article; zbMATH DE number 618155
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts |
scientific article; zbMATH DE number 618155 |
Statements
Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts (English)
0 references
14 August 1994
0 references
graph separators
0 references
VLSI routing
0 references
multicommodity flow
0 references
concurrent flow
0 references
