Zobrazeno 1 - 10
of 142
pro vyhledávání: '"Varadarajan, Kasturi"'
Autor:
Inamdar, Tanmay, Varadarajan, Kasturi
In the Non-Uniform $k$-Center problem, a generalization of the famous $k$-center clustering problem, we want to cover the given set of points in a metric space by finding a placement of balls with specified radii. In $t$-NU$k$C Problem, we assume tha
Externí odkaz:
http://arxiv.org/abs/2111.06362
In this paper, we consider the colorful $k$-center problem, which is a generalization of the well-known $k$-center problem. Here, we are given red and blue points in a metric space, and a coverage requirement for each color. The goal is to find the s
Externí odkaz:
http://arxiv.org/abs/1907.08906
Publikováno v:
Symposium on Computational Geometry 2017: 7:1-7:16
Let $R$ and $B$ be two point sets in $\mathbb{R}^d$, with $|R|+ |B| = n$ and where $d$ is a constant. Next, let $\lambda : R \cup B \to \mathbb{N}$ such that $\sum_{r \in R } \lambda(r) = \sum_{b \in B} \lambda(b)$ be demand functions over $R$ and $B
Externí odkaz:
http://arxiv.org/abs/1903.08263
Autor:
Inamdar, Tanmay, Varadarajan, Kasturi
Several algorithms with an approximation guarantee of $O(\log n)$ are known for the Set Cover problem, where $n$ is the number of elements. We study a generalization of the Set Cover problem, called the Partition Set Cover problem. Here, the elements
Externí odkaz:
http://arxiv.org/abs/1809.06506
Autor:
Inamdar, Tanmay, Varadarajan, Kasturi
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, \mathcal{S})$, where $X$ is a set of elements and $\mathcal{S}$ is a collec
Externí odkaz:
http://arxiv.org/abs/1711.04882
In this article, we consider the following capacitated covering problem. We are given a set $P$ of $n$ points and a set $\mathcal{B}$ of balls from some metric space, and a positive integer $U$ that represents the capacity of each of the balls in $\m
Externí odkaz:
http://arxiv.org/abs/1707.05170
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 two related notions---$\epsilon$-approximations and $\epsilon$-nets--
Externí odkaz:
http://arxiv.org/abs/1702.03676
In the metric multi-cover problem (MMC), we are given two point sets $Y$ (servers) and $X$ (clients) in an arbitrary metric space $(X \cup Y, d)$, a positive integer $k$ that represents the coverage demand of each client, and a constant $\alpha \geq
Externí odkaz:
http://arxiv.org/abs/1602.04152
\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 dissimilarity) measure. Among the clustering problems, specifically \
Externí odkaz:
http://arxiv.org/abs/1512.02985
In this paper we consider two metric covering/clustering problems - \textit{Minimum Cost Covering Problem} (MCC) and $k$-clustering. In the MCC problem, we are given two point sets $X$ (clients) and $Y$ (servers), and a metric on $X \cup Y$. We would
Externí odkaz:
http://arxiv.org/abs/1507.02222