SPP1307 - Clustering Workshop 2009 - Paderborn

Path: Clustering Workshop 2009 > Program

Paderborn - Germany
November 24, 25

Supported by

SPP 1307 - Algorithm Engineering

Program

The workshop takes place in room F0.231.

November 24th - Tuesday

14:00 Opening of the Workshop
14:15 1st Session

Heiko Röglin
k-Means has Polynomial Smoothed Complexity
15:30 Coffee Break
16:00 2nd Session

Katharina Zweig
To cluster or not to cluster - A meta-analytic approach

Christian Komusiewicz
Fixed-parameter tractable generalizations of Cluster Editing

Johannes Uhlmann
Exact Algorithms and Experiments for Hierarchical Tree Clustering

Morteza Monemizadeh (download slides)
Coresets and Sketches for High Dimensional Subspace Approximation Problems

17:45 Break
19:30 Workshop Dinner (Ratskeller)

November 25th - Wednesday

09:00 3rd Session

Henning Meyerhenke (download slides)
On Distributed Clustering

Daniel Kuntze (download slides)
A Lower Bound for Complete Linkage Clustering

Christian Schulz (download slides)
Engineering a Scalable High Quality Graph Partitioner

10:00 Discussion
10:30 Coffee Break
11:00 1st Open Problems Session
12:30 Lunch Break
13:45 2nd Open Problems Session
14:30 Discussion
15:15 Coffee Break
15:30 End of Workshop