A new scaling algorithm for the maximum mean cut problem
- 1 March 1994
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 11 (3) , 243-255
- https://doi.org/10.1007/bf01240735
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A fast algorithm for optimally increasing the edge-connectivityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- New scaling algorithms for the assignment and minimum mean cycle problemsMathematical Programming, 1992
- A Fast and Simple Algorithm for the Maximum Flow ProblemOperations Research, 1989
- Improved Time Bounds for the Maximum Flow ProblemSIAM Journal on Computing, 1989
- Finding minimum-cost circulations by canceling negative cyclesJournal of the ACM, 1989
- A new approach to the maximum-flow problemJournal of the ACM, 1988
- A Faster Strongly Polynomial Minimum Cost Flow AlgorithmPublished by Defense Technical Information Center (DTIC) ,1988
- A characterization of the minimum cycle mean in a digraphDiscrete Mathematics, 1978
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Some recent applications of the theory of linear inequalities to extremal combinatorial analysisProceedings of Symposia in Applied Mathematics, 1960