𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Length of optimal path in random networks with strong disorder

✍ Scribed by Sergey V. Buldyrev; Lidia A. Braunstein; Reuven Cohen; Shlomo Havlin; H.Eugene Stanley

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
237 KB
Volume
330
Category
Article
ISSN
0378-4371

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Efficient Parallel Algorithms for Optima
Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network
✍ Biing-Feng Wang πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 128 KB

In this paper, we propose efficient parallel algorithms on the EREW PRAM for optimally locating in a tree network a path-shaped facility and a tree-shaped facility of a specified length. Edges in the tree network have arbitrary positive lengths. Two optimization criteria are considered: minimum ecce

Ranked solutions to a class of combinato
Ranked solutions to a class of combinatorial optimizationsβ€”with applications in mass spectrometry based peptide sequencing and a variant of directed paths in random media
✍ Timothy P. Doerr; Gelio Alves; Yi-Kuo Yu πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 400 KB

Typical combinatorial optimizations are NP-hard; however, for a particular class of cost functions the corresponding combinatorial optimizations can be solved in polynomial time using the transfer matrix technique or, equivalently, the dynamic programming approach. This suggests a way to efficiently