As part of our ongoing online seminar series, we are happy to announce
our YouTube channel 'Frontiers on Parameterized Complexity'
https://www.youtube.com/channel/UCdfML-PShQNSCeqbz9Ol_oA. The
recordings of all the previous talks in the seminar series can now be
found here.
The next talk of the series will be held on May 14, 2020 at 17:00
GMT+2. Individuals and viewing party groups from around the world can
attend these online talks and interact with the speaker and other
attendees remotely via Zoom.
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.
More details about the seminar series can be found here:
https://frontpc.blogspot.com/2020/04/talks-schedule.html
Speaker: Vincent Cohen-Addad, Google Z\"urich (May 14, 2020 17:00 GMT +2)
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.
********************************************************
Other upcoming talks in the series include:
May 21 2020:
Speaker: Micha\l Pilipczuk, University of Warsaw
Title: Beyond Sparsity
May 28 2020:
Speaker: D\'aniel Marx, Max-Plack-Institut f\"ur Informatik
Title: Incompressibility of H-free edge modification problems: Towards
dichotomy
June 03 2020:
Speaker: Hans Bodlaender, Utrecht University
Title: Typical Sequences Revisited - Computing Width Parameters of Graphs
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/
*
**********************************************************