Fast algorithms for weighted bipartite matching

Lecture Notes in Computer Science

Volumn 3503, Issue , 2005, Pages 476-487

  Schwartz, Justus ^a   Steger, Angelika ^a   Weißl, Andreas ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; PROBABILITY;

BIPARTITE GRAPHS; EDGE WEIGHTS; RUNNING TIME; WEIGHTED BIPARTITE MATCHING;

ALGORITHMS;

EID: 24944583074     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11427186_41     Document Type: Conference Paper

References (22)

1. R. Ahuja, T. Magnanti, and J. Orlin. Network flows. Prentice Hall Inc., Englewood Cliffs, NJ, 1993. Theory, algorithms, and applications.
2. S. Belongie, J. Malik, and J. Puzicha. Shape matching and object recognition using shape contexts. IEEE Trans. Pattern Anal. Mach. Intell., 24(4):509-522, 2002.
3. Y. Cheng, V. Wu, R. Collins, A. Hanson, and E. Riseman. Maximum-weight bipartite matching technique and its application in image feature matching. In SPIE Conference on Visual Communication and Image Processing, 1996.
4. J. Edmonds and R. Karp. Theoretical improvements in algorithmic efficiency for network flow problems. In Combinatorial Structures and their Applications (Proc. Calgary Internat. Conf., Calgary, Alta., 1969), pages 93-96. Gordon and Breach, New York, 1970.
5. P. Erdos and A. Ré́nyi. On random matrices. Magyar Tud. Akad. Mat. Kutató Int. Közl, 8:455-461, 1964.
6. M. Fredman and R. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. J. Assoc. Comput Mach., 34(3):596-615, 1987.
7. A. Frieze and G. Sorkin. The probabilistic relationship between the assignment and asymmetric traveling salesman problems. In Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (Washington, DC, 2001), pages 652-660, Philadelphia, PA, 2001.
8. H. Gabow and R. Tarjan. Almost-optimal speed-ups of algorithms for matching and related problems. In Proceedings 20th Annual ACM Symposium on Theory of Computing (Chicago, IL), pages 514-527, New York, 1988.
9. H.. Gabow and R. Tarjan. Faster scaling algorithms for network problems. SIAM J. Comput., 18(5):1013-1036, 1989.
10. M. Goemans and D. Williamson. A general approximation technique for constrained forest problems. SIAM J. Comput., 24(2):296-317, 1995.
11. A. Goldberg and R. Kennedy. Global price updates help. SIAM J. Discrete Math., 10(4):551-572, 1997.
12. A. Goldberg,. Plotkin, and P. M. Vaidya. Sublinear-time parallel algorithms for matching and related problems. J. Algorithms, 14(2):180-213, 1993.
13. 5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput., 2:225-231, 1973.
14. C. Huang, Y. Chen, Y. Lin, and Y. Hsu. Data path allocation based on bipartite weighted matching. In DAC '90: Proceedings of the 27th ACM/IEEE conference on Design automation, pages 499-504, 1990.
15. D. S. Johnson and C. C. McGeoch (editors). Network flows and matching: First DIMACS implementation challenge, volume 12. AMS, 1993.
16. R. Karp. An algorithm to solve the m × n assignment problem in expected time O(mn log n). Networks, 10(2): 143-152, 1980.
17. H. Kühn. The Hungarian method for the assignment problem. Naval Res. Logist. Quart., 2:83-97, 1955.
18. Y. Lin, H. Chang, and Y. Lin. A study on tools and algorithms for 3-d protein structures alignment and comparison. In Internat. Computer Symposium (ICS'2004), pages 1000-1005, 2004.
19. M. Mucha and P. Sankowski. Maximum matchings via gaussian elimination. In FOCS, pages 248-255, 2004.
20. J. Orlin and R. Ahuja. New scaling algorithms for the assignment and minimum mean cycle problems. Math. Programming, 54(1, Ser. A):41-56, 1992.
21. K. Varadarajan and P. Agarwal. Approximation algorithms for bipartite and non-bipartite matching in the plane. In Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (Baltimore, MD, 1999), pages 805-814, New York, 1999.
22. M. Wattenhofer and R. Wattenhofer. Fast and simple algorithms for weighted perfect matching, submitted, 2004.