Satish B. Rao and Warren D. Smith: "Approximating Geometrical Graphs via `spanners' and `banyans"', Proceedings of the 30th ACM SToC, 1998, 540-550. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Partitioned Neighborhood Spanners of Minimal Outdegree - Fischer, Lukovszki, Ziegler (1999) (5 citations) (Correct)
....many geometric problems. For given finite set P ae IR D , such a graph G = P;E) approximates the complete Euclidean graph up to some factor f 1. f spanners enabled Rao and Smith to construct a FPTAS (Fully Polynomial Time Approximation Scheme) for the Euclidean Travelling Salesperson Problem [21]. Further applications are closest point queries [25] motion planning [7] as well as many range searching problems [1, 18] For example, the objective of a circular range query is reporting all those points p of P lying within a circle of given radius r and center c. Having constructed an f ....
Satish B. Rao and Warren D. Smith: "Approximating Geometrical Graphs via `spanners' and `banyans"', Proceedings of the 30th ACM SToC, 1998, 540-550.
Partitioned Neighborhood Spanners of Minimal Outdegree - Fischer, Lukovszki, Ziegler (1999) (5 citations) (Correct)
....many geometric problems. For given finite set P ae IR D , such a graph G = P; E) approximates the complete Euclidean graph up to some factor f 1. f spanners enabled Rao and Smith to construct a FPTAS (Fully Polynomial Time Approximation Scheme) for the Euclidean Travelling Salesperson Problem [12]. Further applications are closest point queries [15] motion planning [4] as well as many range searching problems [1, 11] For example, the objective of a circular range query is reporting all those points p of P lying within a circle of given radius r and center c. Having constructed an ....
Satish B. Rao and Warren D. Smith: "Approximating Geometrical Graphs via `spanners' and `banyans"', Proceedings of the 30th ACM SToC, 1998, 540-550.
Partitioned Neighborhood Spanners of Minimal Outdegree - Fischer, Lukovszki, Ziegler (1999) (5 citations) (Correct)
....many geometric problems. For given finite set P ae IR D , such a graph G = P;E) approximates the complete Euclidean graph up to some factor f 1. f spanners enabled Rao and Smith to construct a FPTAS (Fully Polynomial Time Approximation Scheme) for the Euclidean Travelling Salesperson Problem [21]. Among other applications are closest point queries [25] motion planning [7] min cost perfect matching [27] as well as many range searching problems [1, 18] For example, the objective of a circular range query is to report all those points p of P lying within a circle of given radius r and ....
Satish B. Rao and Warren D. Smith: "Approximating Geometrical Graphs via `spanners' and `banyans"', Proceedings of the 30th ACM Symposium on Theory of Computing 1998, 540-550.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC