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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Monday, June 07, 2010, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Anastasios Sidiropoulos (TTY-C Chicago)

Metric embeddings for topological graphs

Over the past 15 years, metric embeddings have become an essential tool in theoretical computer science. In this talk I will survey some recent results on embeddings of the shortest-path metrics of graphs into spaces with simpler topology. Such mappings can be used for example to embed a graph of small genus into a planar graph, or a graph of small pathwidth into a tree, with only a small change on the underlying geometry. I will also discuss some implications for the design of approximation algorithms, the Sparsest-Cut problem, and the Gupta-Newman-Rabinovich-Sinclair conjecture.

Based on joint work with Glencora Borradaile, Piotr Indyk, and James R. Lee.


Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   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