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: Thursday, January 22, 2004, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Julian Lorenz

Geometric Clustering Problems

In this talk I will present my diploma thesis on "geometric clustering problems". We will consider two different models, namely k-Clustering and minsum-Clustering. Given n points in R^d, in k-clustering the problem is to find k clusters such that the sum of squared distances of each data point to the center of its cluster is minimized. We will focus on the case when the dimension d is part of the input, and use a dimension reduction technique by Johnson-Lindenstrauss to improve known algorithms. In minsum-clustering the problem is to minimize the sum of all distances between points in the same cluster. I will present an approximation approach by iterative matchings, and give some partial results about its approximation behaviour.

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

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