5 citations · 17 across the 15 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2022★ 2 cited
Clustering What Matters: Optimal Approximation for Clustering with Outliers
Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh +1
Clustering with outliers is one of the most fundamental problems in Computer Science. Given a set of points and two integers and , the clustering with outliers aims…
cs.DS2021
Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H-Minor-Free Graphs
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov +2
We design the first subexponential-time (parameterized) algorithms for several cut and cycle-hitting problems on -minor free graphs. In particular, we obtain the following resul…