An <i>O</i>(log <i>k</i>) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm (Q4388872): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s0097539794285983 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2107881198 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 08:33, 30 July 2024
scientific article; zbMATH DE number 1150637
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An <i>O</i>(log <i>k</i>) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm |
scientific article; zbMATH DE number 1150637 |
Statements
An <i>O</i>(log <i>k</i>) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm (English)
0 references
10 May 1998
0 references
approximation algorithm
0 references
sparse cuts
0 references
network flow
0 references
multicommodity flow
0 references
concurrent flow
0 references
