Friday, June 27, 2008
3:30 pm, MC 5158

Tutte Seminar Series
Combinatorics & Optimization
Spring 2008


Penny Haxell
University of Waterloo

Scarf's Lemma and the Stable Paths Problem

We address a question in graphs called the stable paths problem, which is an abstraction of a network routing problem concerning the Border Gateway Protocol (BGP). The main tool we use is Scarf's Lemma. This talk will describe Scarf's Lemma and how it is related to other results more familiar to combinatorialists, and then will explain its implications for the stable paths problem.