Flows, cuts and integral routing in graphs -- an approximation algorithmist's perspective (Q4589020)
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 6803215
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Flows, cuts and integral routing in graphs -- an approximation algorithmist's perspective |
scientific article; zbMATH DE number 6803215 |
Statements
6 November 2017
0 references
maximum flow
0 references
minimum cut
0 references
network routing
0 references
approximation algorithms
0 references
hardness of approximation
0 references
graph theory
0 references
0.7942083477973938
0 references
0.7894473671913147
0 references
0.787747323513031
0 references
0.7859885096549988
0 references
