On the Max-flow min-cut ratio for directed multicommodity flows (Q818146): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2005.10.037 / rank | |||
| Property / cites work | |||
| Property / cites work: Q4471352 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4471328 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A lower bound on the integrality gap for minimum multicut in directed networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5501283 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2005.10.037 / rank | |||
Normal rank | |||
Latest revision as of 04:04, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Max-flow min-cut ratio for directed multicommodity flows |
scientific article |
Statements
On the Max-flow min-cut ratio for directed multicommodity flows (English)
0 references
24 March 2006
0 references
approximation algorithm
0 references
directed graph
0 references
multicommodity flow and multicut
0 references
0 references
0 references
