21 citations · 28 across the 15 of their papers we have counts for
Showing 2023 · cs.CGShow all
2 papers · 2 filters
cs.CG2023
Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov +2
In the Euclidean Bottleneck Steiner Tree problem, the input consists of a set of points in called terminals and a parameter , and the goal is to compute a Ste…
cs.CG2023
Minimum-Membership Geometric Set Cover, Revisited
Sayan Bandyapadhyay, William Lochet, Saket Saurabh +1
We revisit a natural variant of geometric set cover, called minimum-membership geometric set cover (MMGSC). In this problem, the input consists of a set of points and a set $\m…