hello,
could anyone help me by suggesting a good approximation algorithm for minimum weight perfect matching on graphs? I can't seem to find anything that makes any sense! i'm trying to implement Christofides algorithm for the travelling salesman problem in java but i'm stuck at the perfect matching bit. any help would be greatly appreciated.
thanks,
eoin
Wow, sounds very interesting!
I wish that I could help, but I must admit that I cannot.
2x Xeon 3.2Ghz Nocona with HT, Supermicro X6DAE-G2, 2GB DDR2-3200, Thermaltake Armour SuperTower, 620W Enermax ATX2.2, 2x 160GB HD, nVidia 6200 256MB PCI-E
A Knight is sworn to Honour. His heart knows only Virtue. His blade defends the helpless. His might upholds the Weak. His word speaks only truth. His wrath undoes the Wicked.
Posting Permissions
Reply With Quote