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, April 05, 2007, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Penny Haxell (Univ. of Waterloo)

On stable paths

Let $G$ be a graph with a distinguished vertex $d$. Suppose that each vertex of $G$ has a preference list of a set of paths joining it to $d$. A solution to the stable paths problem is a tree $T$ in $G$ rooted at $d$, with the property that for each vertex $x$, if $x$ prefers some path $P$ to the path from $x$ to $d$ in $T$, then some edge of $P$ not incident to $x$ is missing from $T$. Not every instance of the stable paths problem has a solution, but we show that every instance does have a fractional solution.

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