TY - GEN
T1 - Efficient minimum cost matching using quadrangle inequality
AU - Aggarwal, Alok
AU - Bar-Noy, Amotz
AU - Khuller, Samir
AU - Kravets, Dina
AU - Schieber, Baruch
N1 - Publisher Copyright:
© 1992 IEEE.
PY - 1992
Y1 - 1992
N2 - 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
AB - 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
UR - http://www.scopus.com/inward/record.url?scp=57349156900&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=57349156900&partnerID=8YFLogxK
U2 - 10.1109/SFCS.1992.267793
DO - 10.1109/SFCS.1992.267793
M3 - Conference contribution
AN - SCOPUS:57349156900
T3 - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
SP - 583
EP - 592
BT - Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992
PB - IEEE Computer Society
T2 - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992
Y2 - 24 October 1992 through 27 October 1992
ER -