15 citations · 45 across the 13 of their papers we have counts for
13 papers · 1 filter
On Partial Covering For Geometric Set Systems
Tanmay Inamdar, Kasturi Varadarajan
We study a generalization of the Set Cover problem called the \emph{Partial Set Cover} in the context of geometric set systems. The input to this problem is a set system $(X, \math…
Epsilon-approximations and epsilon-nets
Nabil H. Mustafa, Kasturi R. Varadarajan
The use of random samples to approximate properties of geometric configurations has been an influential idea for both combinatorial and algorithmic purposes. This chapter considers…
On Metric Multi-Covering Problems
Santanu Bhowmick, Tanmay Inamdar, Kasturi Varadarajan
In the metric multi-cover problem (MMC), we are given two point sets (servers) and (clients) in an arbitrary metric space , a positive integer that repre…
On Variants of k-means Clustering
Sayan Bandyapadhyay, Kasturi Varadarajan
\textit{Clustering problems} often arise in the fields like data mining, machine learning etc. to group a collection of objects into similar groups with respect to a similarity (or…
Approximate Clustering via Metric Partitioning
Sayan Bandyapadhyay, Kasturi Varadarajan
In this paper we consider two metric covering/clustering problems - \textit{Minimum Cost Covering Problem} (MCC) and -clustering. In the MCC problem, we are given two point sets…
A Constant Factor Approximation for Orthogonal Order Preserving Layout Adjustment
Sayan Bandyapadhyay, Santanu Bhowmick, Kasturi Varadarajan
Given an initial placement of a set of rectangles in the plane, we consider the problem of finding a disjoint placement of the rectangles that minimizes the area of the bounding bo…