27 citations · 41 across the 8 of their papers we have counts for
4 papers · 1 filter
On Steiner Trees of the Regular Simplex
Henry Fleischmann, Guillermo A. Gamboa Q., Karthik C. S. +2
In the Euclidean Steiner Tree problem, we are given as input a set of points (called terminals) in the -metric space and the goal is to find the minimum-cost tree connectin…
Inapproximability of Maximum Diameter Clustering for Few Clusters
Henry Fleischmann, Kyrylo Karlov, Karthik C. S. +2
In the Max-k-diameter problem, we are given a set of points in a metric space, and the goal is to partition the input points into k parts such that the maximum pairwise distance be…
On Approximability of Steiner Tree in -metrics
Henry Fleischmann, Surya Teja Gavva, Karthik C. S
In the Continuous Steiner Tree problem (CST), we are given as input a set of points (called terminals) in a metric space and ask for the minimum-cost tree connecting them. Addition…
Impossibility of Depth Reduction in Explainable Clustering
Chengyuan Deng, Surya Teja Gavva, Karthik C. S. +2
Over the last few years Explainable Clustering has gathered a lot of attention. Dasgupta et al. [ICML'20] initiated the study of explainable -means and -median clustering pro…