Zobrazeno 1 - 10
of 240
pro vyhledávání: '"Nandy, Subhas C."'
Autor:
Banik, Aritra, Das, Sayani, Maheshwari, Anil, Manna, Bubai, Nandy, Subhas C, M, Krishna Priya K, Roy, Bodhayan, Roy, Sasanka, Sahu, Abhishek
In the Minimum Consistent Subset (MCS) problem, we are presented with a connected simple undirected graph $G=(V,E)$, consisting of a vertex set $V$ of size $n$ and an edge set $E$. Each vertex in $V$ is assigned a color from the set $\{1,2,\ldots, c\
Externí odkaz:
http://arxiv.org/abs/2404.15487
In this article, we study the Euclidean minimum spanning tree problem in an imprecise setup. The problem is known as the \emph{Minimum Spanning Tree Problem with Neighborhoods} in the literature. We study the problem where the neighborhoods are repre
Externí odkaz:
http://arxiv.org/abs/2104.04229
Publikováno v:
Algorithmica 85(7):1850-1882, 2023
We study geometric variations of the discriminating code problem. In the \emph{discrete version} of the problem, a finite set of points $P$ and a finite set of objects $S$ are given in $\mathbb{R}^d$. The objective is to choose a subset $S^* \subsete
Externí odkaz:
http://arxiv.org/abs/2009.10353
A majority of real life networks are weighted and sparse. The present article aims at characterization of weighted networks based on sparsity, as a measure of inherent diversity, of different network parameters. It utilizes sparsity index defined on
Externí odkaz:
http://arxiv.org/abs/2009.06310
In this article, we study a generalized version of the maximum independent set and minimum dominating set problems, namely, the maximum $d$-distance independent set problem and the minimum $d$-distance dominating set problem on unit disk graphs for a
Externí odkaz:
http://arxiv.org/abs/2006.15381
Publikováno v:
In Discrete Applied Mathematics 30 October 2023 338:255-277
In the paper "Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares", TCS Volume 769 (2019), pages 63--74, the LHIT problem is proposed as follows: For a given set of non-intersecting line segments ${\ca
Externí odkaz:
http://arxiv.org/abs/1909.09445
Classical separability problem involving multi-color point sets is an important area of study in computational geometry. In this paper, we study different separability problems for bichromatic point set P=P_r\cup P_b on a plane, where $P_r$ and $P_b$
Externí odkaz:
http://arxiv.org/abs/1905.07124
Let P be a set of n points and each of the points is colored with one of the k possible colors. We present efficient algorithms to pre-process P such that for a given query point q, we can quickly identify the smallest color spanning object of the de
Externí odkaz:
http://arxiv.org/abs/1905.05066
Publikováno v:
In Computational Geometry: Theory and Applications February 2023 109