✦ LIBER ✦

The probabilistic longest path problem

✍ Scribed by Murat, C�cile; Paschos, Vangelis Th.

Publisher: John Wiley and Sons
Year: 1999
Tongue: English
Weight: 141 KB
Volume: 33
Category: Article
ISSN: 0028-3045
DOI: 10.1002/(sici)1097-0037(199905)33:3<207::aid-net7>3.0.co;2-7

No coin nor oath required. For personal study only.

✦ Synopsis

We study the probabilistic longest path problem. We propose a modification strategy adapting a solution for a deterministic instance to a solution for the probabilistic one, we compute the functional associated with this strategy, and we evaluate the complexities of computing this functional and of computing the deterministic solution maximizing it.

📜 SIMILAR VOLUMES

Probabilistic analysis of the longest ha

Probabilistic analysis of the longest hamiltonian tour problem

✍ Rakesh V. Vohra 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 230 KB

Probabilistic approach to the neumann pr

Probabilistic approach to the neumann problem

✍ Pei Hsu 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 845 KB

The Exact Path Length Problem

✍ Matti Nykänen; Esko Ukkonen 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 126 KB

We study a problem related to finding shortest paths in weighted graphs. We ask whether or not there is a path between two nodes that has a given total cost k. The edge weights of the graph can be both positive and negative integers or even integer vectors. We show that many variants of this problem

The constrained shortest path problem

✍ Y. P. Aneja; K. P. K. Nair 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 368 KB

The 2-path network problem

✍ Geir Dahl; Bjarne Johannessen 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB

Probabilistic models for the Steiner Tre

Probabilistic models for the Steiner Tree problem

✍ Vangelis Th. Paschos; Orestis A. Telelis; Vassilis Zissimopoulos 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 216 KB