[DMANET] Reminder: Next talk in Frontiers of Parameterized Complexity on May 14, 2020 by Vincent Cohen-Addad

This is a reminder for this week's talk in the ongoing online seminar
series on Frontiers of Parameterized Complexity. More details about
the seminar series can be found here:
https://frontpc.blogspot.com/2020/04/talks-schedule.html. The
recordings to the previous talks of the series are now available at
our YouTube channel 'Frontiers of Parameterized Complexity'
https://www.youtube.com/channel/UCdfML-PShQNSCeqbz9Ol_oA.

This week's talk will be held on May 14, 2020 at 17:00 GMT+2.

The link to join the meeting on Zoom is https://uib.zoom.us/j/4231169675
Meeting ID: 423 116 9675
Password: Name of the W[1]-complete problem, 6 letters, all capital.
Also known as a set of pairwise adjacent vertices.

Speaker: Vincent Cohen-Addad, Google Z\"urich

Title: On the Parameterized Complexity of Various Clustering Problems

Abstract: Clustering problems are fundamental computational problems.
On the one hand they are at the heart of various data analysis,
bioinformatics or machine learning approaches, on the other hand, they
can be seen as variants of 'set cover' problems (involving e.g.
metrics, graphs with a special structure, etc.) and so are very basic
problems.

For many applications, finding efficient fixed-parameter algorithms is
a very natural approach. Popular choices of parameters are either
parameters of the problem itself (e.g. the number of clusters) or on
the underlying structure of the input (e.g. the dimension in the
metric case). We will focus on classic metric clustering objectives
such as k-median and k-means and review recent results on the fixed
parameter complexity of these problems, and the most important open
problems.

*******************************************************

For more details please contact one of the following.

Roohani Sharma: roohani@imsc.res.in
Saket Saurabh: saket@imsc.res.in
Fedor Fomin: Fedor.Fomin@uib.no

Best regards and cheers!

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************