Proceedings ArticleDOI
Approximation algorithms for geometric tour and network design problems (extended abstract)
Cristian Sorin Mata,Joseph S. B. Mitchell +1 more
- pp 360-369
TLDR
An O(log m) approximation bound algorithm is provided for RBSP, where m < n is the minimum number of sides.About:
This article is published in Symposium on Computational Geometry.The article was published on 1995-09-01. It has received 80 citations till now. The article focuses on the topics: Approximation algorithm & Network planning and design.read more
Citations
More filters
Journal ArticleDOI
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
TL;DR: The previous best approximation algorithm for the problem (due to Christofides) achieves a 3/2-aproximation in polynomial time.
Book ChapterDOI
Approximation Algorithms for Connected Dominating Sets
Sudipto Guha,Samir Khuller +1 more
TL;DR: This work focuses on the question of finding a connected dominating set of minimum size, where the graph induced by vertices in the dominating set is required to be connected.
Journal ArticleDOI
On the Optimal Robot Routing Problem in Wireless Sensor Networks
TL;DR: This paper presents a novel TSPn algorithm for this class of TSPN, which can yield significantly improved results compared to the latest approximation algorithm.
Journal ArticleDOI
Localized Outlying and Boundary Data Detection in Sensor Networks
TL;DR: Simulation results indicate that these algorithms can clearly detect the event boundary and can identify outlying sensors with a high accuracy and a low false alarm rate when as many as 20 percent sensors report outlying readings.
Journal ArticleDOI
Largest and Smallest Convex Hulls for Imprecise Points
Maarten Löffler,Marc van Kreveld +1 more
TL;DR: The problem of computing the smallest and largest possible convex hulls, measured by length and by area, is studied, and polynomial time algorithms for several variants of this problem are given, ranging in running time from O(nlog n) to O( n13).
References
More filters
Journal ArticleDOI
Approximation algorithms for the geometric covering salesman problem
Esther M. Arkin,Refael Hassin +1 more
TL;DR: This work presents simple heuristic procedures for constructing tours, for a variety of neighborhood types, whose length is guaranteed to be within a constant factor of the length of an optimal tour.
Journal ArticleDOI
Efficient binary space partitions for hidden-surface removal and solid modeling
Mike Paterson,F. Frances Yao +1 more
TL;DR: This work considers schemes for recursively dividing a set of geometric objects by hyperplanes until all objects are separated and shows how to generate anO(n2)-sized CSG (constructive-solid-geometry) formula whose literals correspond to half-spaces supporting the faces of the polyhedron.
Journal ArticleDOI
Optimum watchman routes
TL;DR: The problem of finding shortest routes from which every point in a given space is visible (watchman routes) is considered and an O(n loglog n) algorithm is presented to find a shortest route in simple rectilinear polygons.
Book ChapterDOI
Beyond Steiner's Problem: A VLSI Oriented Generalization
Gabriele Reich,Peter Widmayer +1 more
TL;DR: A generalized version of Steiner's problem in graphs, motivated by the wire routing phase in physical VLSI design, is considered: given a connected, undirected distance graph with groups of required vertices and Steiner vertices, find a shortest connected subgraph containing at least one required vertex of each group.
Proceedings ArticleDOI
A pedestrian approach to ray shooting: shoot a ray, take a walk
John Hershberger,Subhash Suri +1 more
TL;DR: In this paper, a simple Steiner triangulation of a simple polygon with the property that a ray can intersect at most O(log n) triangles before reaching the polygon boundary is presented.
Related Papers (5)
Approximation algorithms for the geometric covering salesman problem
Esther M. Arkin,Refael Hassin +1 more