Department of Computer Science | Institute of Theoretical Computer Science | CADMO
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.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996
Information for students and suggested topics for student talks
Automatic MiSe System Software Version 1.4803M | admin login