A strongly polynomial minimum cost circulation algorithm
Combinatorica
Mathematical Programming: Series A and B
A strongly polynomial algorithm to solve combinatorial linear programs
Operations Research
Solving minimum-cost flow problems by successive approximation
STOC '87 Proceedings of the nineteenth 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
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation
Communications of the ACM
Finding minimum-cost circulations by canceling negative cycles
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Advances in homotopic layout compaction
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Finding minimum-cost circulations by canceling negative cycles
Journal of the ACM (JACM)
Fast approximation algorithms for multicommodity flow problems
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Minimizing the number of delay buffers in the synchronization of pipelined systems
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
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
Efficient algorithms for the Hitchcock transportation problem
SODA '92 Proceedings of the third 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
A Polynomial Algorithm for Balancing Acyclic Data Flow Graphs
IEEE Transactions on Computers
TIM: a timing package for two-phase, level-clocked circuitry
DAC '93 Proceedings of the 30th international Design Automation Conference
An implementation of the &egr;-relaxation algorithm on the CM-5
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
A universal-scheme approach to statistical databases containing homogeneous summary tables
ACM Transactions on Database Systems (TODS)
An accelerated interior point method whose running time depends only on A (extended abstract)
STOC '94 Proceedings of the twenty-sixth 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
A min-cost flow based min-cost rectilinear Steiner distance-preserving tree construction
Proceedings of the 1997 international symposium on Physical design
Polynomial time algorithms for some evacuation problems
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Characterization and algorithms for greedily solvable transportation problems
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Implementing weighted b-matching algorithms: towards a flexible software design
Journal of Experimental Algorithmics (JEA)
Address code generation for digital signal processors
Proceedings of the 38th annual Design Automation Conference
Implementing weighted b-matching algorithms: insights from a computational study
Journal of Experimental Algorithmics (JEA)
A Pseudo-Polynomial Primal-Dual Algorithm for Globally Solving aProduction-Transportation Problem
Journal of Global Optimization
Reverse Center Location Problem
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Implementing Weighted b-Matching Algorithms: Insights from a Computational Study
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
An Abstraction Algorithm for the Verification of Level-Sensitive Latch-Based Netlists
Formal Methods in System Design
Efficiency of Algorithms for Solution of Network Problems with Tree-Like Data Structure
Cybernetics and Systems Analysis
Metrics for finite Markov decision processes
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Contraflow network reconfiguration for evacuation planning: a summary of results
Proceedings of the 13th annual ACM international workshop on Geographic information systems
A new Mallows distance based metric for comparing clusterings
ICML '05 Proceedings of the 22nd international conference on Machine learning
Approximating and computing behavioural distances in probabilistic transition systems
Theoretical Computer Science
A combinatorial approximation algorithm for concurrent flow problem and its application
Computers and Operations Research
Escape routing for dense pin clusters in integrated circuits
Proceedings of the 44th annual Design Automation Conference
Faster approximate lossy generalized flow via interior point algorithms
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Energetic reasoning revisited: application to parallel machine scheduling
Journal of Scheduling
Fast (incremental) algorithms for useful classes of simple temporal problems with preferences
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
The Kantorovich Metric in Computer Science: A Brief Survey
Electronic Notes in Theoretical Computer Science (ENTCS)
Structural analysis of a fractional matching problem
Discrete Applied Mathematics
M-description lattice vector quantization: index assignment and analysis
IEEE Transactions on Signal Processing
Detailed-routing algorithms for dense pin clusters in integrated circuits
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Using combinatorial optimization in model-based trimmed clustering with cardinality constraints
Computational Statistics & Data Analysis
Minimal-cost network flow problems with variable lower bounds on arc flows
Computers and Operations Research
A grid-based coverage approach for target tracking in hybrid sensor networks
Journal of Systems and Software
The effect of homogeneity on the complexity of k-anonymity
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Transportation Distances on the Circle
Journal of Mathematical Imaging and Vision
Efficient algorithms for the electric power transaction problem
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Monge properties of sequence alignment
Theoretical Computer Science
Bilevel time minimizing transportation problem
Discrete Optimization
Parallel algorithms for the assignment and minimum-cost flow problems
Operations Research Letters
Bisimulation Metrics for Continuous Markov Decision Processes
SIAM Journal on Computing
Transition-optimal Token Distribution
Fundamenta Informaticae
The effect of homogeneity on the computational complexity of combinatorial data anonymization
Data Mining and Knowledge Discovery
| Hi-index | 0.02 |
We present a new strongly polynomial algorithm for the minimum cost flow problem, based on a refinement of the Edmonds-Karp scaling technique. Our algorithm solves the uncapacitated minimum cost flow problem as a sequence of &Ogr;(n log n) shortest path problems on networks with n nodes and m arcs and runs in &Ogr;(n log n(m + n log n)) steps. Using a standard transformation, this approach yields an &Ogr;(m log n (m + n log n)) algorithm for the capacitated minimum cost flow problem. This algorithm improves the best previous strongly polynomial algorithm due to Galil and Tardos, by a factor of m/n. Our algorithm is even more efficient if the number of arcs with finite upper bounds, say m', is much less than m. In this case, the number of shortest path problems solved is &Ogr;((m + n) log n).