skip to main | skip to sidebar

greeness notes

Monday, November 03, 2008

Hungarian Method

Easy to understand examples:

http://www.ee.oulu.fi/~mpa/matreng/eem1_2-1.htm

http://www.ams.jhu.edu/~castello/362/Handouts/hungarian.pdf

http://www.public.iastate.edu/~ddoty/HungarianAlgorithm.html

animation: http://www.ifors.ms.unimelb.edu.au/tutorial/hungarian/index.html

topcoder tutorial: Assignment Problem and Hungarian Algorithm (very good regarding theory and c++ code)

http://www.math.uwo.ca/~mdawes/courses/344/kuhn-munkres.pdf

Posted by greeness at 9:04 PM
Labels: graph
Newer Post Older Post Home

Labels

  • dp
  • bit operation
  • c++
  • graph
  • search
  • design patterns
  • math
  • recursion
  • string
  • linux programming
  • backtracking
  • data structure
  • disjoint set
  • divide and conquer
  • jobhunting
  • linear algebra
  • matrix
  • sweeping

Blog Archive

  • ►  2009 (6)
    • ►  12 (1)
    • ►  11 (4)
    • ►  02 (1)
  • ▼  2008 (56)
    • ▼  11 (9)
      • Repeated Squaring
      • quadtree
      • Add without +
      • C++ notes II
      • 3Sum problem
      • Maximun Flow
      • Hungarian Method
      • String Searching
      • Suffix Tree
    • ►  10 (25)
    • ►  09 (22)
  • ►  2005 (33)
    • ►  06 (3)
    • ►  05 (1)
    • ►  04 (2)
    • ►  03 (6)
    • ►  02 (12)
    • ►  01 (9)