Probabilistic Analysis of Network Flow Algorithms

DOI10.1287/moor.18.1.71zbMath0780.90039OpenAlexW2150476282MaRDI QIDQ4697084

Noam Nisan, Richard M. Karp

Publication date: 29 June 1993

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/e759922e1c3ca3d377fc2d735ea2261673328199

zbMATH Keywords

minimum cutprobabilistic analysislinear time algorithmsmultiple sources and sinksmaximum-flowcapacitated transportation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (2)

A Fast Algorithm for Finding Strong Starters ⋮ Probabilistic Analysis of Geometric Location Problems

This page was built for publication: Probabilistic Analysis of Network Flow Algorithms