✦ LIBER ✦

Small and large TSP: Two polynomially solvable cases of the traveling salesman problem

✍ Scribed by René van Dal; Jack A.A. van der Veen; Gerard Sierksma

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 805 KB
Volume: 69
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(93)90096-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A solvable case of the traveling salesma

A solvable case of the traveling salesman problem

✍ Eugene L. Lawler 📂 Article 📅 1971 🏛 Springer-Verlag 🌐 English ⚖ 113 KB

A new solvable case of the traveling sal

A new solvable case of the traveling salesman problem

✍ Maciej M. Sysło 📂 Article 📅 1973 🏛 Springer-Verlag 🌐 English ⚖ 64 KB

The computational complexity of graph co

The computational complexity of graph contractions II: Two tough polynomially solvable cases

✍ Asaf Levin; Daniel Paulusma; Gerhard J. Woeginger 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 369 KB

A worst-case analysis of two approximate

A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem

✍ Giovanni Righini; Marco Trubian 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 251 KB

The travelling salesman problem and a cl

The travelling salesman problem and a class of polyhedra of diameter two

✍ Manfred W. Padberg; M. R. Rao 📂 Article 📅 1974 🏛 Springer-Verlag 🌐 English ⚖ 731 KB

Graph traversals, genes and matroids: An

Graph traversals, genes and matroids: An efficient case of the travelling salesman problem

✍ Dan Gusfield; Richard Karp; Lusheng Wang; Paul Stelling 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 993 KB

In this paper we consider graph traversal problems (Euler and Travelling Salesman traversals) that arise from a particular technology for DNA sequencing -sequencing by hybridization (SBH). We first explain the connection of the graph problems to SBH and then focus on the traversal problems. We descr