A simpler max-product maximum weight matching algorithm and the auction algorithm

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2006, Pages 557-561

  Bayati, Mohsen ^a   Shah, Devavrat ^b   Sharma, Mayank ^c  

^a STANFORD UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUCTION ALGORITHM; MAXIMUM WEIGHT MATCHING (MWM);

COMBINATORIAL OPTIMIZATION; COMPUTER VISION; ITERATIVE DECODING; PROBLEM SOLVING;

ALGORITHMS;

EID: 39049159245     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2006.261778     Document Type: Conference Paper

References (6)

1. J. Edmonds and R. Karp, "Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems," Jour. of the ACM, Vol. 19, pp 248-264, 1972.
2. D. P. Bertsekas , "The Auction Algorithm: A Distributed Relaxation Method for the Assignment Problem," Annals of Operations Research, Vol. 14, pp. 105-123, 1988.
3. D. P. Bertsekas, "Auction Algorithms for Network Flow Problems: A Tutorial Introduction," Computational Optimization and Applications, Vol. 1, pp. 7-66, 1992
4. M. Bayati, D. Shah and M. Sharma, "Maximum Weight Matching via Max-Product Belief Propagation," Proc. IEEE Int. Symp. Information Theory, 2005.
5. M. Bayati, D. Shah and M. Sharma, "Maximum Weight Matching via Max-Product Belief Propagation," (longer version) submitted, available at http://www.stanford.edu/~bayati/papers/mpmwm.ps, 2005
6. P. O. Vontobel and R. Koetter, personal communication