|Mittagsseminar Talk Information|
Date and Time: Tuesday, November 23, 2004, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Leo Rüst
Some problems (e.g. the generalized linear complementarity problem) can be mapped to a unique sink orientation (USO) of a grid such that the solution to the problem corresponds to the unique sink of the grid. We are interested in the expected number of vertices a randomized algorithm needs to evaluate until it finds the sink, where a vertex evaluation returns the orientation of all incident edges.
In this talk, the focus will be on small grid-USOs and mainly on 2xn-grids, which we call "n-ladders". The hope is that the analysis of algorithms on ladders will yield new ideas for the general grid case.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 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.3392 | admin login