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, May 21, 2015, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Antonis Thomas

The Reachability of Unique Sink Orientations

In this talk, we introduce and study the reachmap and niceness of a USO. The former is the set of coordinates that are reachable with directed paths from a given vertex. For the latter, we say that a USO is i-nice, if every vertex can reach in at most i steps another vertex with strictly smaller reachmap. The niceness concept is useful as a natural upper bound on the number of vertex evaluations of the Random Edge (simplex) algorithm. We prove matching upper and lower bounds on the niceness of cyclic and acyclic USOs.

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