Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, January 29, 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

Unique Sink Orientations on Grids

Certain linear complementarity problems (LCP) can be transformed into the problem of finding the unique sink in a USO on a cube. USOs on grids can be derived from certain generalized LCPs (GLCP), where the solution to the GLCP corresponds to the unique sink in the grid-USO.
I will present some recent results about USOs on grids, including:
- A characterization which makes it possible to check efficiently if an orientation on a grid is a USO.
- The expected running time of the algorithm Random Facet, which finds the unique sink on a grid-USO.

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