Seminar | February 26 | 4-5:30 p.m. | 1011 Evans Hall
David P. Williamson, Operations Research and Information Engineering, Cornell University
In this talk, I will look at a classical problem from graph theory of finding a large cut in a graph. Well start with a 1967 result of Erdős that showed that picking a random partition of the graph finds a cut that is at least half the largest possible cut. Well then describe a result due to Goemans and myself from 1995 that shows that by representing the graph as a set of vectors, one per vertex, and optimizing the set, one can find a cut of size at least .878 the largest possible. If time permits, well see an additional application of this vector representation to either clustering or coloring.