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: Tuesday, May 27, 2008, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Jiří Matoušek (Charles Univ., Prague)

Low-distortion embeddings in R^d

We consider the problem of embedding a given n-point metric space into the Euclidean space of dimension d, where d is considered fixed (and small). We review worst-case bounds on the required distortion, and we present new results on inapproximability of the minimum distortion by a polynomial-time algorithm. In particular, for d=3 or larger, we show that it is hard to distinguish spaces that admit embedding with a constant distortion from spaces requiring distortion of order n^{const/d}.

Joint work with Anastasios Sidiropoulos.

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