𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New algorithms for the LCA problem and the binary tree reconstruction problem

✍ Scribed by Zhaofang Wen

Book ID
107766170
Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
580 KB
Volume
51
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Dual algorithms for the shortest path tr
Dual algorithms for the shortest path tree problem
✍ Pallottino, Stefano; ScutellοΏ½, Maria Grazia πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 117 KB πŸ‘ 2 views

We consider dual approaches for the Shortest Path Tree problem. After a brief introduction to the problem, we review the most important dual algorithms which have been described in the literature for its solution and propose a new family of dual ascent algorithms. In these algorithms, ''local'' and