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, November 23, 2021, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Saeed Ilchi

Perfect Matching in the Plane with Small Detour

Consider a perfect matching M on a point set of size 2n in the plane. A point p is a k-detour for M if for any matched pair of points (a,b), we have |a - p| + |p - b| ≤ k|a - b|. For any point set, we show that there is always a matching with a 2/sqrt(3)-detour. This is tight due to a simple lower bound that can be obtained from equilateral triangles. The best previous bound was sqrt(2).

This is a joint work with Bernd Gärtner, Yoshio Okamoto, Patrick Schnider, and Tim Taubner.

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