Graph traversals, genes, and matroids: An efficient case of the travelling salesman problem
- Univ. of California, Davis, CA (United States)
- Univ. of Washington, Seattle, WA (United States)
In this paper the authors consider graph traversal problems that arise from a particular technology for DNA sequencing - sequencing by hybridization (SBH). They first explain the connection of the graph problems to SBH and then focus on the traversal problems. They describe a practical polynomial time solution to the Travelling Salesman Problem in a rich class of directed graphs (including edge weighted binary de Bruijn graphs), and provide a bounded-error approximation algorithm for the maximum weight TSP in a superset of those directed graphs. The authors also establish the existence of a matroid structure defined on the set of Euler and Hamilton paths in the restricted class of graphs. 8 refs., 5 figs.
- DOE Contract Number:
- FG03-90ER60999
- OSTI ID:
- 492116
- Report Number(s):
- CONF-960679--
- Country of Publication:
- United States
- Language:
- English
Similar Records
The cost-constrained traveling salesman problem
Comparative Study of Variations in Quantum Approximate Optimization Algorithms for the Traveling Salesman Problem