Add to ORKGWe present a (k +h)-FPT algorithm for computing a shortest tour that sees k specified points in a polygon with h holes. We also present a k-FPT approximation algorithm for this problem having approximation factor √2. In addition, we prove that the general problem cannot be polynomially approximated better than by a factor of (log n), unless P=NP, where n is the total number of edges of the polygon
We give an algorithm to compute a (Euclidean) shortest path in a polygon with h holes and a total of...
We consider the Minimum Perimeter Polygon Problem (MP3): for a given set V of points in the plane, f...
In TSP with neighborhoods (TSPN) we are given a collec-tion X of k polygonal regions, called neighbo...
We present a (k +h)-FPT algorithm for computing a shortest tour that sees k specified points in a po...
We present a (k +h)-FPT algorithm for computing a shortest tour that sees k specified points in a po...
We present a (k+ h)-FPT algorithm for computing a shortest tour that sees k specified points in a po...
AbstractA watchman tour in a polygonal domain (for short, polygon) is a closed curve in the polygon ...
We give an algorithm to compute a (Euclidean) shortest path in a polygon with h holes and a total o...
AbstractA watchman tour in a polygonal domain (for short, polygon) is a closed curve in the polygon ...
Given a sequence of k polygons in the plane, a start point s, and a target point, t, we seek a short...
An $O(n^4loglogn)$ algorithm for shortest watchman tour (SWT) problem for simple polygons, given a s...
An $O(n^4loglogn)$ algorithm for shortest watchman tour (SWT) problem for simple polygons, given a s...
This paper gives a partitioning scheme for the geometric, planar traveling salesman problem, under t...
We consider the Minimum Perimeter Polygon Problem (MP3): for a given set V of points in the plane, f...
We consider the Minimum Perimeter Polygon Problem (MP3): for a given set V of points in the plane, f...
We give an algorithm to compute a (Euclidean) shortest path in a polygon with h holes and a total of...
We consider the Minimum Perimeter Polygon Problem (MP3): for a given set V of points in the plane, f...
In TSP with neighborhoods (TSPN) we are given a collec-tion X of k polygonal regions, called neighbo...
We present a (k +h)-FPT algorithm for computing a shortest tour that sees k specified points in a po...
We present a (k +h)-FPT algorithm for computing a shortest tour that sees k specified points in a po...
We present a (k+ h)-FPT algorithm for computing a shortest tour that sees k specified points in a po...
AbstractA watchman tour in a polygonal domain (for short, polygon) is a closed curve in the polygon ...
We give an algorithm to compute a (Euclidean) shortest path in a polygon with h holes and a total o...
AbstractA watchman tour in a polygonal domain (for short, polygon) is a closed curve in the polygon ...
Given a sequence of k polygons in the plane, a start point s, and a target point, t, we seek a short...
An $O(n^4loglogn)$ algorithm for shortest watchman tour (SWT) problem for simple polygons, given a s...
An $O(n^4loglogn)$ algorithm for shortest watchman tour (SWT) problem for simple polygons, given a s...
This paper gives a partitioning scheme for the geometric, planar traveling salesman problem, under t...
We consider the Minimum Perimeter Polygon Problem (MP3): for a given set V of points in the plane, f...
We consider the Minimum Perimeter Polygon Problem (MP3): for a given set V of points in the plane, f...
We give an algorithm to compute a (Euclidean) shortest path in a polygon with h holes and a total of...
We consider the Minimum Perimeter Polygon Problem (MP3): for a given set V of points in the plane, f...
In TSP with neighborhoods (TSPN) we are given a collec-tion X of k polygonal regions, called neighbo...