| |
| | Citations: New Lower Bound Techniques for Robot Motion Planning - Canny, Reif (ResearchIndex) (Site not responding. Last check: 2007-10-08) |
 | | Canny and J. Reif, New lower bound techniques for robot motion planning problems, in Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987, pp. |
 | | Canny and J. Reif, New lower bound techniques for robot motion planning in Proceedings of the 28th Annual Symposium on Foundations of Computer Science, Los Angeles, CA, 1987, pp. |
 | | Polynomial time approximation algorithms for arbitrary (but fixed) dimensions are examined in a variety of papers [1,4,10 12] Note, however, that [11,12] do not prove bounds on the goodness of their approximation. |
| citeseer.ist.psu.edu /context/736/0 (2957 words) |
|