4 citations · 5 across the 5 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DS2020
To Close Is Easier Than To Open: Dual Parameterization To k-Median
Jarosław Byrka, Szymon Dudycz, Pasin Manurangsi +2
The -Median problem is one of the well-known optimization problems that formalize the task of data clustering. Here, we are given sets of facilities and clients , and the…
cs.CC2020
Optimal polynomial-time compression for Boolean Max CSP
Bart M. P. Jansen, Michał Włodarczyk
In the Boolean maximum constraint satisfaction problem - Max CSP - one is given a collection of weighted applications of constraints from a finite constraint language , ove…