University of Bonn · Institute of Computer Science · Theoretical Computer Science

Sidebar

  • Home
  • People
  • Research
  • Teaching
    • Portfolio
    • By semester (including past and future semesters)

Current Semester (WiSe 19/20)

Bachelor
  • Logik und diskrete Strukturen
  • Algorithmen und Berechnungskomplexität I
  • Projektgruppe Entwurf und Implementierung von Algorithmen (Röglin, Abels)
  • Projektgruppe Algorithm Engineering (Mutzel, Charfreitag)
  • Randomisierte und approximative Algorithmen
Master
  • Advanced Algorithms
  • Discrete and Computational Geometry
  • Lab Combinatorial Algorithms
  • Seminar Algorithmic Game Theory
  • Lab Efficient Algorithms for Selected Problems (Röglin, Schmidt)
  • Lab Advanced Algorithms (Kesselheim)

MA-INF 1307 - Seminar Advanced Algorithms 2019/2020

This seminar is planned for winter 2019/2020. Details of the organization will be announced later.

Preliminary list of topics

Coresets for clustering

Har-Peled, Mazumdar: Coresets for k-Means and k-Median Clustering and their Applications
Chen: On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
Ackermann et. al.: StreamKM++: A clustering algorithm for data streams
Fichtenberger et. al.: BICO: BIRCH meets Coresets for k-means clustering

Clustering with outliers

Charikar, Khuller, Mount, Narasimhan: Algorithms for facility location problems with outlier
Malkomes, Kusner, Chen, Weinberger, Moseley: Fast Distributed k-Center Clustering with Outliers on Massive Data
Guha, Li, Zhang: Distributed Partial Clustering


Page Tools

Imprint/Impressum