4 citations · 4 across the 4 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.NI2020★ 4 cited
Online Dynamic B-Matching With Applications to Reconfigurable Datacenter Networks
Marcin Bienkowski, David Fuchssteiner, Jan Marcinkowski +1
This paper initiates the study of online algorithms for the maximum weight -matching problem, a generalization of maximum weight matching where each node has at most …