𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A probabilistic analysis of the switching algorithm for the euclidean TSP

✍ Scribed by Walter Kern

Publisher
Springer-Verlag
Year
1989
Tongue
English
Weight
266 KB
Volume
44
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Approximation algorithms for the Euclide
Approximation algorithms for the Euclidean bipartite TSP
✍ Andreas Baltz; Anand Srivastav πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 214 KB

We study approximation results for the Euclidean bipartite traveling salesman problem (TSP). We present the first worstcase examples, proving that the approximation guarantees of two known polynomial-time algorithms are tight. Moreover, we propose a new algorithm which displays a superior average ca

On the asymptotic analysis of the Euclid
On the asymptotic analysis of the Euclidean algorithm
✍ G.H. Norton πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 213 KB

Let N > 2 and 8 > 0. For uniformly distributed integers in the interval I-1, N], the Euclidean algorithm requires an average of 121n2( 1 divisions, where C is Porter's constant.

Complexity analysis of the SAT engine: D
Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms
✍ Masami Hagiya; John A. Rose; Ken Komiya; Kensaku Sakamoto πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 123 KB

Taking advantage of the power of DNA molecules to spontaneously form hairpin structures, Sakamoto et al. designed a molecular algorithm to solve instances of the satisΓΏability problem on Boolean expressions in clausal form (the SAT problem), and by developing new experimental techniques for molecula