%0 Conference Paper
%B Foundations of Computer Science, 1992. Proceedings., 33rd Annual Symposium on
%D 1992
%T Efficient minimum cost matching using quadrangle inequality
%A Aggarwal,A.
%A Bar-Noy,A.
%A Khuller, Samir
%A Kravets,D.
%A Schieber,B.
%K algorithm;
%K array;
%K bipartite
%K bitonic
%K blue
%K complexity;
%K computational
%K cost
%K distance;
%K Euclidean
%K function;
%K geometry;
%K graph
%K graphs;
%K inequality;
%K linear
%K MATCHING
%K matching;
%K minimisation;
%K minimum
%K Monge
%K perfect
%K points;
%K polynomial
%K problem;
%K quadrangle
%K red
%K theory;
%K TIME
%K transportation
%K transportation;
%K weakly
%X The authors present efficient algorithms for finding a minimum cost perfect matching, and for solving the transportation problem in bipartite graphs, G = (Red cup; Blue, Red times; Blue), where |Red| = n, |Blue| = m, n les; m, and the cost function obeys the quadrangle inequality. The first results assume that all the red points and all the blue points lie on a curve that is homeomorphic to either a line or a circle and the cost function is given by the Euclidean distance along the curve. They present a linear time algorithm for the matching problem. They generalize the method to solve the corresponding transportation problem in O((m+n)log(m+n)) time. The next result is an O(n log m) algorithm for minimum cost matching when the cost array is a bitonic Monge array. An example of this is when the red points lie on one straight line and the blue points lie on another straight line (that is not necessarily parallel to the first one). Finally, they provide a weakly polynomial algorithm for the transportation problem in which the associated cost array is a bitonic Monge array
%B Foundations of Computer Science, 1992. Proceedings., 33rd Annual Symposium on
%P 583 - 592
%8 1992/10//
%G eng
%R 10.1109/SFCS.1992.267793