Solving minimum-cost flow problems by successive approximation

Authors:
A. Goldberg;R. Tarjan
Affiliations:
Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge MA;Department of Computer Science, Princeton University, Princeton, NJ and AT&T Bell Laboratories, Murray Hill, NJ
Venue:
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Year:
1987

Citing 15
Cited 31

Linear programming: methods and applications (5th ed.)

Linear programming: methods and applications (5th ed.)
Data structures and network algorithms

Data structures and network algorithms
Self-adjusting binary search trees

Journal of the ACM (JACM)
Complexity of network synchronization

Journal of the ACM (JACM)
Scaling algorithms for network problems

Journal of Computer and System Sciences
A strongly polynomial minimum cost circulation algorithm

Combinatorica
A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm

Mathematical Programming: Series A and B
A new approach to the maximum flow problem

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Relaxation methods for minimum cost ordinary and generalized network flow problems

Operations Research
An O(n2 log n) parallel max-flow algorithm

Journal of Algorithms
A data structure for dynamic trees

Journal of Computer and System Sciences
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Journal of the ACM (JACM)
A Distributed Algorithm for Minimum-Weight Spanning Trees

ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallelism in random access machines

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing

Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation

Communications of the ACM
A faster strongly polynomial minimum cost flow algorithm

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Finding minimum-cost circulations by canceling negative cycles

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Almost-optimum speed-ups of algorithms for bipartite matching and related problems

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
An Efficient Distributed Protocol for Finding Shortest Paths in Networks with Negative Weights

IEEE Transactions on Software Engineering
Finding minimum-cost circulations by canceling negative cycles

Journal of the ACM (JACM)
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
Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Short length versions of Menger's theorem

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Methods for optimizing register placement in synchronous circuits derived using software pipelining techniques

Proceedings of the 14th international symposium on Systems synthesis
Routing restorable bandwidth guaranteed connections using maximum 2-route flows

IEEE/ACM Transactions on Networking (TON)
Solving the Convex Cost Integer Dual Network Flow Problem

Management Science
Scheduling and optimal register placement for synchronous circuits derived using software pipelining techniques

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Unweaving a web of documents

Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Mobility Limited Flip-Based Sensor Networks Deployment

IEEE Transactions on Parallel and Distributed Systems
Design closure driven delay relaxation based on convex cost network flow

Proceedings of the conference on Design, automation and test in Europe
Movement-assisted sensor redeployment scheme for network lifetime increase

Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
QoS routing in GMPLS-capable integrated IP/WDM networks with router cost constraints

Computer Communications
Faster approximate lossy generalized flow via interior point algorithms

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
An exterior simplex type algorithm for the Minimum Cost Network Flow Problem

Computers and Operations Research
Network flow-based power optimization under timing constraints in MSV-driven floorplanning

Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
Review: A survey of movement strategies for improving network coverage in wireless sensor networks

Computer Communications
Parallel synchronous and asynchronous implementations of the auction algorithm

Parallel Computing
Multicore parallelization of min-cost flow for CAD applications

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems - Special section on the ACM IEEE international conference on formal methods and models for codesign (MEMOCODE) 2009
Efficient algorithms for the electric power transaction problem

WINE'05 Proceedings of the First international conference on Internet and Network Economics
A faster polynomial algorithm for the constrained maximum flow problem

Computers and Operations Research
Energy efficient online routing of flows with additive constraints

Computer Networks: The International Journal of Computer and Telecommunications Networking
Belief Propagation for Min-Cost Network Flow: Convergence and Correctness

Operations Research
Constructing sensor barriers with minimum cost in wireless sensor networks

Journal of Parallel and Distributed Computing
Jetway: minimizing costs on inter-datacenter video traffic

Proceedings of the 20th ACM international conference on Multimedia
Capacity-Constrained network-voronoi diagram: a summary of results

SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases

Quantified Score

Hi-index	0.02

Visualization

Abstract

We introduce a framework for solving minimum-cost flow problems. Our approach measures the quality of a solution by the amount that the complementary slackness conditions are violated. We show how to extend techniques developed for the maximum flow problem to improve the quality of a solution. This framework allows us to achieve &Ogr;(min(n3, n5/3 m2/3, nm log n) log (nC)) running time.