𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Probabilistic analysis of the longest hamiltonian tour problem

✍ Scribed by Rakesh V. Vohra

Publisher
John Wiley and Sons
Year
1988
Tongue
English
Weight
230 KB
Volume
18
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The probabilistic longest path problem
The probabilistic longest path problem
✍ Murat, CοΏ½cile; Paschos, Vangelis Th. πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 141 KB

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

Probabilistic analysis of an asymptotica
Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem
✍ C.T. Ng; X. Cai; T.C.E. Cheng πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 135 KB πŸ‘ 2 views

Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well-known NP-hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optima