Finding an optimal path without growing the tree

For problems on computing an optimal path as well as its length in a certain setting, the “standard” approach for finding an actual optimal path is by building (or “growing”) a single-source optimal path tree. In this paper, we study a class of optimal path problems with the following phenomenon: Th...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of algorithms Vol. 49; no. 1; pp. 13 - 41
Main Authors:	Chen, Danny Z., Daescu, Ovidiu, Hu, Xiaobo (Sharon), Xu, Jinhui
Format:	Journal Article Conference Proceeding
Language:	English
Published:	San Diego, CA Elsevier Inc 01.10.2003 Elsevier
Subjects:	Algorithmics. Computability. Computer arithmetics Applied sciences Arrangements Combinatorics Combinatorics. Ordered structures Computational geometry Computer science; control theory; systems Convex and discrete geometry Dynamic programming Exact sciences and technology Geometry Graph theory Mathematical programming Mathematics Operational research and scientific management Operational research. Management science Optimal paths Sciences and techniques of general use Space-efficient algorithms Theoretical computing Arrangements Computational geometry Optimal paths Space-efficient algorithms Dynamic programming Tree data structures Computer theory Shortest path Scheduling Combinatorial optimization Arrangement Knapsack problem Space-efficient algorithm Space complexity Algorithm complexity Optimal path
ISSN:	0196-6774, 1090-2678
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!