Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Last revision Both sides next revision
staff:clusteringgroup [2019/02/08 16:58]
schmidt [People]
staff:clusteringgroup [2019/02/08 17:00]
schmidt [Publications]
Line 24: Line 24:
  
 ==== Publications ==== ==== Publications ====
-  * Clemens Rösner, Melanie Schmidt: Privacy preserving clustering with constraints. [[https://​arxiv.org/​abs/​1802.02497|CoRR abs/​1802.02497]],​ 2018.+  ​* Ioana O. Bercea, Martin Groß, Samir Khuller, Aounon Kumar, Clemens Rösner, Daniel R. Schmidt, Melanie Schmidt: On the cost of essentially fair clusterings. [[https://​arxiv.org/​abs/​1811.10319|CoRR abs/​1811.10319]],​ 2019.  
 +  * Anna Großwendt, Heiko Röglin, Melanie Schmidt: Analysis of Ward's method. SODA 2019 
 +  ​* Clemens Rösner, Melanie Schmidt: Privacy preserving clustering with constraints. [[https://​arxiv.org/​abs/​1802.02497|CoRR abs/​1802.02497]], ​ICALP 2018.
   * Euiwoong Lee, Melanie Schmidt, John Wright: Improved and simplified inapproximability for k-means. Information Processing Letters 120: 40-43, 2017. Also see [[https://​arxiv.org/​abs/​1509.00916|CoRR abs/​1509.00916]].   * Euiwoong Lee, Melanie Schmidt, John Wright: Improved and simplified inapproximability for k-means. Information Processing Letters 120: 40-43, 2017. Also see [[https://​arxiv.org/​abs/​1509.00916|CoRR abs/​1509.00916]].
   * Anupam Gupta, Guru Guruganesh, Melanie Schmidt: Approximation Algorithms for Aversion k-Clustering via Local k-Median. [[http://​drops.dagstuhl.de/​opus/​volltexte/​2016/​6218/​|ICALP 2016: 66:​1-66:​13]],​ 2016.   * Anupam Gupta, Guru Guruganesh, Melanie Schmidt: Approximation Algorithms for Aversion k-Clustering via Local k-Median. [[http://​drops.dagstuhl.de/​opus/​volltexte/​2016/​6218/​|ICALP 2016: 66:​1-66:​13]],​ 2016.
  

Page Tools