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, April 11, 2006, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Jan Remy

A Quasi-Polynomial Time Approximation Scheme for Minimum Weight Triangulation

The Minimum Weight Triangulation problem is to find a triangulation of minimum length for a given set of points P in the Euclidean plane. It is one of the few longstanding open problems from the famous list of twelve problems with unknown complexity status, published by Garey and Johnson in 1979. Very recently the problem was shown to be NP-hard by Mulzer and Rote. In this talk, I will present a quasi-polynomial time approximation scheme for Minimum Weight Triangulation.

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