Long tours and short superstrings
- 17 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 166-177
- https://doi.org/10.1109/sfcs.1994.365696
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Approximating Shortest SuperstringsSIAM Journal on Computing, 1997
- Parallel and sequential approximation of shortest superstringsPublished by Springer Nature ,1994
- The Traveling Salesman Problem with Distances One and TwoMathematics of Operations Research, 1993
- Approximation algorithms for the shortest common superstring problemInformation and Computation, 1989
- A greedy approximation algorithm for constructing shortest common superstringsTheoretical Computer Science, 1988
- On the worst‐case performance of some algorithms for the asymmetric traveling salesman problemNetworks, 1982
- On finding minimal length superstringsJournal of Computer and System Sciences, 1980
- An Analysis of Approximations for Finding a Maximum Weight Hamiltonian CircuitOperations Research, 1979
- P-Complete Approximation ProblemsJournal of the ACM, 1976
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972