Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Complexity Classification of Colouring Problems with Parity Constraints
Rémy Belmonte, Juan Pablo Bravo, Noleen Köhler +1
We study variants of graph colouring with parity constraints. More specifically, we consider -colourings of a graph where, for every…
cs.DS2026
On the Parameterized Complexity of Min-Sum-Radii
Pankaj Kumar, Haiko Müller, Sebastian Ordyniak +1
In the Min-Sum-Radii (MSR) clustering problem, we are given a finite set X of n points in a metric space. The objective is to find at most k clusters centered at a subset of these…