2 papers
math.CO2023
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…
cs.CG2023
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…