An O(log k) approximate min-cut max-flow theorem and approximation algorithm

Yonatan Aumann; Yuval Rabani

doi:10.1137/S0097539794285983

An O(log k) approximate min-cut max-flow theorem and approximation algorithm

Yonatan Aumann^*, Yuval Rabani

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

203 Scopus citations

Abstract

It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This improves upon the previously best-known bound of O(log² k) and is existentially tight, up to a constant factor. An algorithm for finding a cut with ratio within a factor of O(log k) of the maximum concurrent flow, and thus of the optimal min-cut ratio, is presented.

Original language	English
Pages (from-to)	291-301
Number of pages	11
Journal	SIAM Journal on Computing
Volume	27
Issue number	1
DOIs	https://doi.org/10.1137/S0097539794285983
State	Published - Feb 1998
Externally published	Yes

Keywords

Approximation algorithms
Cuts
Multicommodity flow
Network flow
Sparse cuts

Access to Document

10.1137/S0097539794285983

Cite this

@article{f29847df40f944739ebe2e275a89d61d,

title = "An O(log k) approximate min-cut max-flow theorem and approximation algorithm",

abstract = "It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This improves upon the previously best-known bound of O(log2 k) and is existentially tight, up to a constant factor. An algorithm for finding a cut with ratio within a factor of O(log k) of the maximum concurrent flow, and thus of the optimal min-cut ratio, is presented.",

keywords = "Approximation algorithms, Cuts, Multicommodity flow, Network flow, Sparse cuts",

author = "Yonatan Aumann and Yuval Rabani",

year = "1998",

month = feb,

doi = "10.1137/S0097539794285983",

language = "אנגלית",

volume = "27",

pages = "291--301",

journal = "SIAM Journal on Computing",

issn = "0097-5397",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "1",

}

TY - JOUR

T1 - An O(log k) approximate min-cut max-flow theorem and approximation algorithm

AU - Aumann, Yonatan

AU - Rabani, Yuval

PY - 1998/2

Y1 - 1998/2

N2 - It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This improves upon the previously best-known bound of O(log2 k) and is existentially tight, up to a constant factor. An algorithm for finding a cut with ratio within a factor of O(log k) of the maximum concurrent flow, and thus of the optimal min-cut ratio, is presented.

AB - It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This improves upon the previously best-known bound of O(log2 k) and is existentially tight, up to a constant factor. An algorithm for finding a cut with ratio within a factor of O(log k) of the maximum concurrent flow, and thus of the optimal min-cut ratio, is presented.

KW - Approximation algorithms

KW - Cuts

KW - Multicommodity flow

KW - Network flow

KW - Sparse cuts

UR - http://www.scopus.com/inward/record.url?scp=0000927271&partnerID=8YFLogxK

U2 - 10.1137/S0097539794285983

DO - 10.1137/S0097539794285983

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0000927271

SN - 0097-5397

VL - 27

SP - 291

EP - 301

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

IS - 1

ER -

An O(log k) approximate min-cut max-flow theorem and approximation algorithm

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this