10 citations · 33 across the 24 of their papers we have counts for
3 papers · 2 filters
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…
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…
Coresets for Clustering in Geometric Intersection Graphs
Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar
Designing coresets--small-space sketches of the data preserving cost of the solutions within -approximate factor--is an important research direction in the study of cente…