Zobrazeno 11 - 20
of 153
pro vyhledávání: '"Roy, Sasanka"'
Autor:
Bhore, Sujoy, Chakraborty, Sourav, Jana, Satyabrata, Mitchell, Joseph S.B., Pandit, Supantha, Roy, Sasanka
Publikováno v:
In Discrete Applied Mathematics 15 October 2022 319:111-120
Publikováno v:
In Theoretical Computer Science 11 September 2022 929:69-80
This paper discusses the problem of covering and hitting a set of line segments $\cal L$ in ${\mathbb R}^2$ by a pair of axis-parallel squares such that the side length of the larger of the two squares is minimized. We also discuss the restricted ver
Externí odkaz:
http://arxiv.org/abs/1709.04870
Publikováno v:
In Computational Geometry: Theory and Applications January 2022 100
Maximum independent set from a given set $D$ of unit disks intersecting a horizontal line can be solved in $O(n^2)$ time and $O(n^2)$ space. As a corollary, we design a factor 2 approximation algorithm for the maximum independent set problem on unit
Externí odkaz:
http://arxiv.org/abs/1611.03260
In this paper, we study different variations of minimum width color-spanning annulus problem among a set of points $P=\{p_1,p_2,\ldots,p_n\}$ in $I\!\!R^2$, where each point is assigned with a color in $\{1, 2, \ldots, k\}$. We present algorithms for
Externí odkaz:
http://arxiv.org/abs/1609.04148
We study several variations of line segment covering problem with axis-parallel unit squares in $I\!\!R^2$. A set $S$ of $n$ line segments is given. The objective is to find the minimum number of axis-parallel unit squares which cover at least one en
Externí odkaz:
http://arxiv.org/abs/1607.07256
Given a convex polygon $P$ with $n$ vertices, the two-center problem is to find two congruent closed disks of minimum radius such that they completely cover $P$. We propose an algorithm for this problem in the streaming setup, where the input stream
Externí odkaz:
http://arxiv.org/abs/1512.02356
Gaussian Processes are widely used for regression tasks. A known limitation in the application of Gaussian Processes to regression tasks is that the computation of the solution requires performing a matrix inversion. The solution also requires the st
Externí odkaz:
http://arxiv.org/abs/1509.05142
Facility location problems are captivating both from theoretical and practical point of view. In this paper, we study some fundamental facility location problems from the space-efficient perspective. Here the input is considered to be given in a read
Externí odkaz:
http://arxiv.org/abs/1409.4092