Search Results for author:
Found 4 papers, 0 papers with code
On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem
For the Euclidean version of the problem, for instance, combining our results with known results on Euclidean TSP, yields a PTAS for approximating an optimal cyclic solution, and it yields a $(2(1-1/k)+\varepsilon)$-approximation of the optimal unrestricted solution.
2D Fractional Cascading on Axis-aligned Planar Subdivisions
In 2D fractional cascading, the input includes a planar subdivision for every vertex of $G$ and the query is a point $q$ and a subgraph $\pi$ and the goal is to locate the cell containing $q$ in all the subdivisions associated with the vertices of $\pi$.
Computational Geometry
Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency
The problem is NP-hard, as it has the traveling salesman problem as a special case (when $k=1$ and all sites have the same weight).
The Query Complexity of a Permutation-Based Variant of Mastermind
We study the query complexity of a permutation-based variant of the guessing game Mastermind.
