✦ LIBER ✦

On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees

✍ Scribed by G. Das; S. Kapoor; M. Smid

Publisher: Springer
Year: 1997
Tongue: English
Weight: 152 KB
Volume: 19
Category: Article
ISSN: 0178-4617
DOI: 10.1007/pl00009183

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The traveling-salesman problem and minim

The traveling-salesman problem and minimum spanning trees: Part II

✍ Michael Held; Richard M. Karp 📂 Article 📅 1971 🏛 Springer-Verlag 🌐 English ⚖ 644 KB

On the relationship of approximation alg

On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem

✍ Frank Korner 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 249 KB

On minimum spanning trees and the interg

On minimum spanning trees and the intergradation of clusters

✍ Warshauer, Steven M. ;Smosna, Richard 📂 Article 📅 1981 🏛 Springer 🌐 English ⚖ 588 KB

On the number of spanning trees and Eule

On the number of spanning trees and Eulerian tours in iterated line digraphs

✍ Zhang Huaxiao; Zhang Fuji; Huang Qiongxiang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 448 KB

On the numbers of spanning trees and Eul

On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs

✍ Xueliang Li; Fuji Zhang 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 756 KB

On the expected number of optimal and ne

On the expected number of optimal and near-optimal solutions to the Euclidean travelling salesman problem

✍ Selim G. Akl 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 138 KB

An algorithm for empirically calculating the expected number of optimal and near-optimal solutions in a random Euclidean travelling salesman problem is presented. The algorithm is based on well known geometric properties of the optimal tour. For problems involving up to 15 points uniformily distribu