# New scaling algorithms for the assignment and minimum mean cycle problems

@article{Orlin1992NewSA,
title={New scaling algorithms for the assignment and minimum mean cycle problems},
author={James B. Orlin and Ravindra K. Ahuja},
journal={Mathematical Programming},
year={1992},
volume={54},
pages={41-56}
}
• Published 1 February 1992
• Computer Science
• Mathematical Programming
AbstractIn this paper we suggest new scaling algorithms for the assignment and minimum mean cycle problems. Our assignment algorithm is based on applying scaling to a hybrid version of the recentauction algorithm of Bertsekas and the successive shortest path algorithm. The algorithm proceeds by relaxing the optimality conditions, and the amount of relaxation is successively reduced to zero. On a network with 2n nodes,m arcs, and integer arc costs bounded byC, the algorithm runs in O( \sqrt n…
104 Citations
• Computer Science, Mathematics
SIAM Journal on Optimization
• 2022
This work revisits Min-Mean-Cycle and gives a much faster approximation algorithm that, for graphs with polylogarithmic diameter, has near-linear runtime and is the first algorithm whose runtime for the complete graph scales in the number of vertices as $\tilde{O}(n^2)$.
• Computer Science
SODA
• 2017
An O(nm) time algorithm to determine the minimum length directed cycle (also called the "minimum weight directed cycle") in a directed network with n nodes and m arcs and with no negative length directed cycles is introduced.
• Computer Science, Mathematics
• 2014
The algorithmic question is reducible to the problem of a logarithmic number of min-plus matrix multiplications of n n-matrices, where n is the number of vertices of the graph and W is the maximum value of the weights.
• Computer Science
Proceedings 1999 Design Automation Conference (Cat. No. 99CH36361)
• 1999
One of the most surprising results of this paper is that Howard's algorithm, known primarily in the stochastic control community, is by far the fastest algorithm on the test suite although the only known bound on its running time is exponential.
• Computer Science, Mathematics
GandALF
• 2013
It is shown that the algorithmic question is reducible in O(n^2) time to the problem of a logarithmic number of min-plus matrix multiplications of n-by-n matrices, where n is the number of vertices of the graph.
• Computer Science
Discret. Appl. Math.
• 1994
• Computer Science
STOC
• 2019
It is proved that approximating directed APSP and exactly computing the Min-Max Product are equivalent, and the first strongly polynomial approximation scheme for Min-Plus Convolution in strongly subquadratic time is obtained and an equivalence of approximate Min- plus Convolution and exact Min- Max Convolution is proved.
• Computer Science
SODA
• 2021
We present an O(nm) algorithm for all-pairs shortest paths computations in a directed graph with n nodes, m arcs, and nonnegative integer arc costs. This matches the complexity bound attained by
• Computer Science
CAV
• 2015
This work considers the core algorithmic problems related to verification of systems with respect to three classical quantitative properties, namely, the mean-payoff property, the ratio property, and the minimum initial credit for energy property and presents some algorithms that present a significant speedup on standard benchmarks.
• Computer Science, Mathematics
Algorithmica
• 2005
The running time of several graph and network algorithms when applied to dense graphs is improved upon, including how to compute on a machine with word size λ=Ω (logn) a maximal matching in ann-vertex bipartite graph in timeO(n2+n2.5/λ), and how to solve the single source shortest-path problem with integer costs in the range in time0 (n2(logC)/logn).

## References

SHOWING 1-10 OF 25 REFERENCES

• Computer Science
• 1989
The auction algorithm is generalized to solve linear minimum cost network flow problems and it is shown that for at least some classes of bipartite problems, the auction algorithm outperforms substantially current state-of-the-art algorithms.
• Computer Science
Math. Program.
• 1988
A class of recently-proposed linear-cost network flow methods which are amenable to distributed implementation using the notion ofε-complementary slackness is reviewed, and two specific methods, theε-relaxation algorithm for the minimum-cost flow problem, and the auction algorithms for the assignment problem are presented.
We propose a massively parallelizable algorithm for the classical assignment problem. The algorithm operates like an auction whereby unassigned persons bid simultaneously for objects thereby raising
• R. Karp
• Computer Science
Math. Oper. Res.
• 1977
This work considers partitioning algorithms for the approximate solution of large instances of the traveling-salesman problem in the plane, in which partitioning is used in conjunction with existing heuristic algorithms.
• Computer Science
JACM
• 1989
It is shown that a judicious choice of cycles for canceling leads to a polynomial bound on the number of iterations in this algorithm, which is comparable to those of the fastest previously known algorithms.
• Computer Science
SIAM J. Comput.
• 1975
An algorithm of Dinic for finding the maximum flow in a network is described. It is then shown that if the vertex capacities are all equal to one, the algorithm requires at most \$O(|V|^{1/2} \cdot
• E. Dijkstra
• Mathematics, Computer Science
Numerische Mathematik
• 1959
A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
• Physics
JACM
• 1987
Using F-heaps, a new data structure for implementing heaps that extends the binomial queues proposed by Vuillemin and studied further by Brown, the improved bound for minimum spanning trees is the most striking.
This method might be called a “paper strip method” for analysis of variance and is similar to paper strip methods used for operations with polynomials.