Data structures and network algorithms
Data structures and network algorithms
Self-adjusting binary search trees
Journal of the ACM (JACM)
A strongly polynomial minimum cost circulation algorithm
Combinatorica
Mathematical Programming: Series A and B
Solving minimum-cost flow problems by successive approximation
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
A new approach to the maximum-flow problem
Journal of the ACM (JACM)
A data structure for dynamic trees
Journal of Computer and System Sciences
A faster strongly polynomial minimum cost flow algorithm
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Note on Weintraub's minimum-cost circulation algorithm
SIAM Journal on Computing
Improved time bounds for the maximum flow problem
SIAM Journal on Computing
Faster scaling algorithms for network problems
SIAM Journal on Computing
Finding minimum-cost circulations by successive approximation
Mathematics of Operations Research
An O(n2(m + Nlog n)log n) min-cost flow algorithm
Journal of the ACM (JACM)
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
EFFICIENT GRAPH ALGORITHMS FOR SEQUENTIAL AND PARALLEL COMPUTERS
EFFICIENT GRAPH ALGORITHMS FOR SEQUENTIAL AND PARALLEL COMPUTERS
Tight bounds on the number of minimum-mean cycle cancellations and related results
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Minimizing capacity violations in a transshipment network
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Geometric lower bounds for parametric matroid optimization
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A polynomial combinatorial algorithm for generalized minimum cost flow
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Polynomial methods for separable convex optimization in unimodular spaces
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Scaling algorithms for the shortest paths problem
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
A faster algorithm for minimum cost submodular flows
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
Mathematics of Operations Research
A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Balanced matching of buyers and sellers in e-marketplaces: the barter trade exchange model
ICEC '04 Proceedings of the 6th international conference on Electronic commerce
Chips on wafers, or packing rectangles into grids
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
A simple GAP-canceling algorithm for the generalized maximum flow problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Fast (incremental) algorithms for useful classes of simple temporal problems with preferences
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Chips on wafers, or packing rectangles into grids
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
Optimizing ad hoc trade in a commercial barter trade exchange
Electronic Commerce Research and Applications
Optimal wiring topology for electromigration avoidance considering multiple layers and obstacles
Proceedings of the 19th international symposium on Physical design
Scheduling bursts using interval graphs in optical burst switching networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Maximum flows and parametric shortest paths in planar graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Advanced combinatorial algorithms
Algorithms and theory of computation handbook
A contamination aware droplet routing algorithm for the synthesis of digital microfluidic biochips
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Optimal distribution of fluxes in complex topological network
MMACTEE'09 Proceedings of the 11th WSEAS international conference on Mathematical methods and computational techniques in electrical engineering
A direct barter model for course add/drop process
Discrete Applied Mathematics
Multi-unit differential auction-barter model for electronic marketplaces
Electronic Commerce Research and Applications
Speed dating: an algorithmic case study involving matching and scheduling
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Efficient algorithms for the electric power transaction problem
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Approximate binary search algorithms for mean cuts and cycles
Operations Research Letters
Algorithms for the minimum cost circulation problem based on maximizing the mean improvement
Operations Research Letters
Belief Propagation for Min-Cost Network Flow: Convergence and Correctness
Operations Research
An overview of algorithms for network survivability
ISRN Communications and Networking
WiT: optimal wiring topology for electromigration avoidance
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Capacity-Constrained network-voronoi diagram: a summary of results
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
| Hi-index | 0.00 |
A classical algorithm for finding a minimum-cost circulation consists of repeatedly finding a residual cycle of negative cost and canceling it by pushing enough flow around the cycle to saturate an arc. We show that a judicious choice of cycles for canceling leads to a polynomial bound on the number of iterations in this algorithm. This gives a very simple strongly polynomial algorithm that uses no scaling. A variant of the algorithm that uses dynamic trees runs in &Ogr;(nm(log n)min{log(nC), m log n}) time on a network of n vertices, m arcs, and arc costs of maximum absolute value C. This bound is comparable to those of the fastest previously known algorithms.