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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of algorithms Ročník 49; číslo 1; s. 13 - 41
Hlavní autoři:	Chen, Danny Z., Daescu, Ovidiu, Hu, Xiaobo (Sharon), Xu, Jinhui
Médium:	Journal Article Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	San Diego, CA Elsevier Inc 01.10.2003 Elsevier
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!