Journal: Journal of the Association for Computing Machinery

Found 15 papers in total
A parallel shortest augmenting path algorithm for the assignment problem
A parallel shortest augmenting path algorithm for the assignment problem
1991,
A parallel version of the shortest augmenting path algorithm for the assignment...
Las Vegas algorithms for linear and integer programming when the dimension is small
Las Vegas algorithms for linear and integer programming when the dimension is small
1995,
This paper gives an algorithm for solving linear programming problems. For a problem...
A parallel shortest augmenting path algorithm for the assignment problem
A parallel shortest augmenting path algorithm for the assignment problem
1991,
A parallel version of the shortest augmenting path algorithm for the assignment...
The maximum concurrent flow problem
The maximum concurrent flow problem
1990,
The maximum concurrent flow problem (MCFP) is a multicommodity flow problem in which...
Faster algorithms for the shortest path problem
Faster algorithms for the shortest path problem
1990,
Efficient implementations of Dijkstra's shortest path algorithm are investigated. A...
An efficient algorithm for the ‘optimal’ stable marriage
An efficient algorithm for the ‘optimal’ stable marriage
1987,
In an instance of size n of the stable marriage problem, each of n men and n women...
Parallel algorithms for minimum cuts and maximum flows in planar networks
Parallel algorithms for minimum cuts and maximum flows in planar networks
1987,
Algorithms are given that compute maximum flows in planar directed networks either in...
Fibonacci heaps and their uses in improved network optimization algorithms
Fibonacci heaps and their uses in improved network optimization algorithms
1987,
In this paper the authors develop a new data structure for implementing heaps...
New applications of failure functions
New applications of failure functions
1987,
Presented are several algorithms whose operations are governed by a principle of...
Using dual approximation algorithms for scheduling problems: Theoretical and practical results
Using dual approximation algorithms for scheduling problems: Theoretical and practical results
1987,
The problem of scheduling a set of n jobs on m identical machines so as to minimize...
A new class of heuristic algorithms for weighted perfect matching
A new class of heuristic algorithms for weighted perfect matching
1988,
The minimum-weight perfect matching problem for complete graphs of n vertices with...
A new approach to the maximum-flow problem
A new approach to the maximum-flow problem
1988,
All previously known efficient maximum-flow algorithms work by finding augmenting...
An O(n2(m+nlogn)logn) min-cost flow algorithm
An O(n2(m+nlogn)logn) min-cost flow algorithm
1988,
The minimum-cost flow problem is: Given a network with n vertices and m edges, find a...
A common schema for dynamic programming and branch and bound algorithms
A common schema for dynamic programming and branch and bound algorithms
1989,
A new model for dynamic programming and branch and bound algorithms is presented. The...
The time complexity of maximum matching by simulated annealing
The time complexity of maximum matching by simulated annealing
1988,
The random, heuristic search algorithm called simulated annealing is considered for...
Papers per page: