Journal of the ACM Bibliography
Egon
Balas, Donald
Miller, Joseph
Pekny, and Paolo Toth.
A parallel shortest augmenting path algorithm for the assignment
problem. Journal of the ACM, 38(4):985-1004, October 1991.
[BibTeX entry]
Categories and Subject Descriptors:
C.1.2 [Processor Architectures]: Multiple Data Stream
Architectures (Multiprocessors) -- parallel processors; F.2.1
[Analysis of Algorithms and Problem Complexity]:
Numerical Algorithms and Problems -- computation on matrices;
G.1.0 [Numerical Analysis] -- parallel
algorithms; G.1.3 [Numerical Analysis]: Numerical
Linear Algebra -- sparse and very large systems; G.1.6
[Numerical Analysis]: Optimization -- linear
programming; G.2.1 [Discrete Mathematics]:
Combinatorics -- combinatorial algorithms; G.2.2
[Discrete Mathematics]: Graph Theory -- graph
algorithms, network problems, path and circuit
problems; I.1.2 [Algebraic Manipulation]:
Algorithms -- analysis of algorithms
General Terms:
Algorithms, Experimentation, Performance
Additional Key Words and Phrases:
Assignment, matching, shortest augmenting paths, traveling salesman
problem
Selected references
Shortcuts: