Finding an optimal path without growing the tree

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1461 LNCS, Issue , 1998, Pages 356-367

  Chen, Danny Z ^a   Daescu, Ovidiu ^a   Hu, Xiaobo ^a   Xu, Jinhui ^a  

^a University of Notre Dame   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; FORESTRY; TREES (MATHEMATICS);

ALGORITHMIC SOLUTIONS; BEST-KNOWN ALGORITHMS; DYNAMIC PROGRAMMING PROBLEMS; OPTIMAL PATHS; SEARCH TECHNIQUE; SINGLE SOURCE; SPACE COMPLEXITY; TREE GROWING;

DYNAMIC PROGRAMMING;

EID: 84896743817     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68530-8_30     Document Type: Conference Paper

References (19)

1. E.G. Anagnostou, L.J. Guibas, and V.G. Polimenis, "Topological sweeping in three dimensions," Lecture Notes in Computer Science, Vol. 450, Proc. SIGAL International Symp. on Algorithms, Springer-Verlag, 1990, pp. 310-317.
2. T. Asano, L.J. Guibas, and T. Tokuyama, "Walking in an arrangement topo-logically," Int. J. of Computational Geometry & Applications, Vol. 4, No. 2, 1994, pp. 123-151.
3. T. Asano and T. Tokuyama, "Topological walk revisited," Proc. 6th Canadian Conf. on Computational Geometry, 1994, pp. 1-6.
4. P. Bose, W. Evans, D. Kirkpatrick, M. McAllister, and J. Snoeyink, "Approximating shortest paths in arrangements of lines," Proc. 8th Canadian Conf. on Computational Geometry, 1996, pp. 143-148.
5. C. Chan and G.H. Young, "Single-vehicle scheduling problem on a straight line with time window constraints," Proc. 1st Annual International Conf. on Computing and Combinatorics, 1995, pp. 617-626.
6. V. Chvatal, D.A. Klarner, and D.E. Knuth, "Selected combinatorial research problems," STAN-CS-72-292, 26, Stanford University, June 1972.
7. T. Dey, "Improved bounds for k-sets and k-th levels," Proc. 38th Annual IEEE Symp. on Foundations of Computer Science, 1997.
8. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, Berlin, 1987.
9. H. Edelsbrunner and L.J. Guibas, "Topologically sweeping an arrangement," J. of Computer and System Sciences, Vol. 38, 1989, pp. 165-194.
10. H. Edelsbrunner and E.P. Mücke, "Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms," ACM Trans. on Graphics, Vol. 9, 1990, pp. 66-104.
11. H. Edelsbrunner and E. Welzl, "Constructing belts in two-dimensional arrangements with applications," SIAM J. Comput., Vol. 15, 1986, pp. 271-284.
12. D. Eppstein and D. Hart, "An efficient algorithm for shortest paths in vertical and horizontal segments," Lecture Notes in Computer Science, Vol. 1272, Proc. 5th International Workshop on Algorithms and Data Structures, Springer-Verlag, 1997, pp. 234-247.
13. P. Erdös, L. Lovász, A. Simmons, and E.G. Straus, "Dissection graphs of planar point sets," In J.N. Srivastava et al. (Eds.), A Survey of Combinatorial Theory, North Holland, 1973, pp. 139-149.
14. D.S. Hirschberg, "A linear-space algorithm for computing maximal common subsequences," Comm. ACM, Vol. 18, No. 6, 1975, pp. 341-343.
15. P.N. Klein, S. Rao, M.H. Rauch, and S. Subramanian, "Faster shortest-path algorithms for planar graphs," Proc. 26th Annual ACM Symp. Theory of Computing, 1994, pp. 27-37.
16. L. Lovász, "On the number of halving lines," Ann. Univ. Sci. Budapest, E ötvös, Sec. Math., Vol. 14, 1971, pp. 107-108.
17. S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations, Wiley, New York, 1990.
18. H.N. Psaraftis, M.M. Solomon, T.L. Magnanti and T.-U. Kim, "Routing and scheduling on a shoreline with release times," Management Science, Vol. 36, No. 2, 1990, pp. 212-223.
19. R.A. Wagner and M.J. Fischer, "The string-to-string correction problem," J. ACM, Vol. 21, No. 1, 1974, pp. 168-173.