Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, May 21, 2015, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Antonis Thomas
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.
Automatic MiSe System Software Version 1.4803M | admin login