1 paper
Paweł Gawrychowski, Nadav Krasnopolsky, Shay Mozes +1
In the k-dispersion problem, we need to select k nodes of a given graph so as to maximize the minimum distance between any two chosen nodes. This can be seen as a generalizatio…