Efficient minimum cost matching using quadrangle inequality
Document Type
Conference Proceeding
Publication Date
1-1-1992
Abstract
The authors present efficient algorithms for finding a minimum cost perfect matching, and for solving the transportation problem in bipartite graphs, G = (Red union Blue, Red ∗ Blue), where mod Red mod = n, mod Blue mod = m, n
Identifier
57349156900 (Scopus)
ISBN
[0818629002]
Publication Title
Proceedings Annual IEEE Symposium on Foundations of Computer Science Focs
External Full Text Location
https://doi.org/10.1109/SFCS.1992.267793
ISSN
02725428
First Page
583
Last Page
592
Volume
1992-October
Grant
N00014-87-K-825
Fund Ref
Defense Advanced Research Projects Agency
Recommended Citation
Aggarwal, Alok; Bar-Noy, Amotz; Khuller, Samir; Kravets, Dina; and Schieber, Baruch, "Efficient minimum cost matching using quadrangle inequality" (1992). Faculty Publications. 17477.
https://digitalcommons.njit.edu/fac_pubs/17477
COinS
