Approximating Geometrical Graphs via "Spanners" and "Banyans"

@inproceedings{Rao1998ApproximatingGG,
  title={Approximating Geometrical Graphs via "Spanners" and "Banyans"},
  author={Satish Rao and Warren D. Smith},
  booktitle={STOC},
  year={1998}
}
probability l/2 in a Monte Carlo sense2 in time The main result of t,his paper is an improvement of Arora’s method to find (l+e) approximations for geometric NP-hard problems including the Euclidean Traveling Salesman Problem and t.he Euclidean Steiner Minimum Tree problems. For f&d dimension d and E, our algorithms run in O(NlogN) time. (s\/;i) O(d(+.&)d-‘) N + O(dN log N) 
Highly Influential
This paper has highly influenced 23 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 112 extracted citations

Similar Papers

Loading similar papers…