Algorithms and complexity analysis for some flow problems

Authors:
Edith Cohen;Nimrod Megiddo
Affiliations:
Department of Computer Science, Stanford University, Stanford, CA and IBM Almaden Research Center;IBM Research, Almaden Research Center, San Jose, CA and School of Mathematical Sciences, Tel Aviv, University, Tel Aviv, Israel
Venue:
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Year:
1991

Citing 8
Cited 1

A strongly polynomial minimum cost circulation algorithm

Combinatorica
A strongly polynomial algorithm to solve combinatorial linear programs

Operations Research
Strongly polynomial-time and NC algorithms for detecting cycles in dynamic graphs

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Using separation algorithms in fixed dimension

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Journal of the ACM (JACM)
Two-Commodity Flow

Journal of the ACM (JACM)
Parametric Combinatorial Computing and a Problem of Program Module Distribution

Journal of the ACM (JACM)
The complexity of some problems in parametric linear and combinatorial programming

The complexity of some problems in parametric linear and combinatorial programming

Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.01

Visualization

Abstract