Zobrazeno 1 - 10
of 221
pro vyhledávání: '"Subhash Suri"'
Publikováno v:
ACM Transactions on Algorithms. 18:1-37
We investigate dynamic versions of geometric set cover and hitting set where points and ranges may be inserted or deleted, and we want to efficiently maintain an (approximately) optimal solution for the current problem instance. While their static ve
Autor:
Kyle Klein, Subhash Suri
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 26:2010-2016
We resolve a several-years old open question in visibility-based pursuit evasion: how many pursuers are needed to capture an evader in an arbitrary polygonal environment with obstacles? The evader is assumed to be adversarial, moves with the same max
We consider multiwinner elections in Euclidean space using the minimax Chamberlin-Courant rule. In this setting, voters and candidates are embedded in a $d$-dimensional Euclidean space, and the goal is to choose a committee of $k$ candidates so that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::edfb18947fc4dc9bc4b274e5ce03368f
Publikováno v:
Computational Geometry. 82:32-44
We consider the Minimum Dominating Set ( MDS ) problem on the intersection graphs of geometric objects. Even for simple and widely-used geometric objects such as rectangles, no sub-logarithmic approximation is known for the problem and (perhaps surpr
Given a set of points $P$ and axis-aligned rectangles $\mathcal{R}$ in the plane, a point $p \in P$ is called \emph{exposed} if it lies outside all rectangles in $\mathcal{R}$. In the \emph{max-exposure problem}, given an integer parameter $k$, we wa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9a10cbf231de79fa3200a74b9cdfec0b
Autor:
Pat Morin, Subhash Suri
This book constitutes the refereed proceedings of the 18th International Symposium on Algorithms and Data Structures, WADS 2023, held during July 31-August 2, 2023. The 47 regular papers, presented in this book, were carefully reviewed and selected f
Autor:
Subhash Suri, Kevin Verbeek
Publikováno v:
Symposium on Computational Geometry
Computational Geometry, 59, 1-12. Elsevier
Computational Geometry, 59, 1-12. Elsevier
We consider the problem of embedding an undirected graph into hyperbolic space with minimum distortion. A fundamental problem in its own right, it has also drawn a great deal of interest from applied communities interested in empirical analysis of la
Autor:
Kab Kevin Verbeek, Subhash Suri
Publikováno v:
International Journal of Computational Geometry and Applications, 26(3-4), 151-166. World Scientific
Let [Formula: see text] be a set of stochastic sites, where each site is a tuple [Formula: see text] consisting of a point [Formula: see text] in [Formula: see text]-dimensional space and a probability [Formula: see text] of existence. Given a query
Publikováno v:
Computational Geometry. 90:101650
In the minimum constraint removal problem, we are given a set of overlapping geometric objects as obstacles in the plane, and we want to find the minimum number of obstacles that must be removed to reach a target point t from the source point s by an