Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts (Q4302277)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 618155
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8995141983032227
0 references
0.896582841873169
0 references
0.8523395657539368
0 references
0.8473195433616638
0 references
0.8473194241523743
0 references
