MSR is W[1]-hard parameterized by k+Delta on weighted bipartite graphs and by vertex cover number plus k, but FPT parameterized by treewidth plus Delta on weighted graphs.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
A 2D Voronoi-diagram data structure answers smallest-enclosing-disk rectangle queries in O(log^4 n) deterministic time after O(n log^2 n) preprocessing.
citing papers explorer
-
On the Parameterized Complexity of Min-Sum-Radii
MSR is W[1]-hard parameterized by k+Delta on weighted bipartite graphs and by vertex cover number plus k, but FPT parameterized by treewidth plus Delta on weighted graphs.
-
Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams
A 2D Voronoi-diagram data structure answers smallest-enclosing-disk rectangle queries in O(log^4 n) deterministic time after O(n log^2 n) preprocessing.