Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, April 14, 2005, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Justus Schwartz
Given a complete bipartite graph with edge weights generated according to the uniform distribution over the real interval [0,1] and integer weights uniform from the interval [0,C] we consider the problem of computing a minimum weight bipartite matching. By pruning heavy edges for continuous weights an expected running time of O(n2 log n) and for integer weights an expected running time of O(n2) is achieved.
Automatic MiSe System Software Version 1.4803M | admin login