Abstract 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 …

We present approximation algorithms for the Fault-tolerant $ k $-Supplier with Outliers
($\mathsf {F} k\mathsf {SO} $) problem. This is a common generalization of two known …

Collective Location Selection (CLS) has received significant research attention in the spatial
database community due to its wide range of applications. The CLS problem selects a group …

In this paper, we study the problem of {\em $ k $-center clustering with outliers}. The problem
has many important applications in real world, but the presence of outliers can significantly …

We study the problem of $ k $-means clustering in the space of straight-line segments in
$\mathbb {R}^{2} $ under the Hausdorff distance. For this problem, we give a $(1+\epsilon) …

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. Additional …

We study the problem of k-means clustering in the space of straight-line segments in R2
under the Hausdorff distance. For this problem, we give a (1+ ϵ)-approximation algorithm …

We consider some computational aspects of problems in geometry and analysis like the
hardness of approximation of discrete Steiner trees, computing explicit signings in Kadison …