๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The analysis of evolutionary algorithms on sorting and shortest paths problems

โœ Scribed by Jens Scharnow; Karsten Tinnefeld; Ingo Wegener

Publisher
Springer Netherlands
Year
2005
Tongue
English
Weight
161 KB
Volume
3
Category
Article
ISSN
1570-1166

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An Incremental Algorithm for a Generaliz
An Incremental Algorithm for a Generalization of the Shortest-Path Problem
โœ G. Ramalingam; Thomas Reps ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 363 KB

The grammar problem, a generalization of the single-source shortest-path prob-ลฝ ลฝ . ลฝ . . lem introduced by D. E. Knuth Inform. Process. Lett. 6 1 1977 , 1แŽ5 is to compute the minimum-cost derivation of a terminal string from each nonterminal of a given context-free grammar, with the cost of a deriv

The time-dependent shortest pair of disj
The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms
โœ Sherali, Hanif D.; Ozbay, Kaan; Subramanian, Shivaram ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 160 KB ๐Ÿ‘ 3 views

In this paper, we examine complexity issues, models, and algorithms for the problem of finding a shortest pair of disjoint paths between two nodes of a network such that the total travel delay is minimized, given that the individual arc delays are time-dependent. Such disjoint paths address the issu

On the all-pairs shortest-path algorithm
On the all-pairs shortest-path algorithm of Moffat and Takaoka
โœ Kurt Mehlhorn; Volker Priebe ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 213 KB ๐Ÿ‘ 3 views

We review how to solve the all-pairs shortest-path problem in a nonnegatively ลฝ 2 . weighted digraph with n vertices in expected time O n log n . This bound is shown to hold with high probability for a wide class of probability distributions on nonnegatively weighted ลฝ . digraphs. We also prove that