Prof. Emo Welzl and Prof. Bernd Gärtner
|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
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.
Automatic MiSe System Software Version 1.4803M | admin login