Long tours and short superstrings

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 1994, Pages 166-177

  Kosaraju, S Rao ^a   Park, James K ^b   Stein, Clifford ^b  

^a JOHNS HOPKINS UNIVERSITY   (United States)

^b DARTMOUTH COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; GRAPHIC METHODS; TRAVELING SALESMAN PROBLEM; UNDIRECTED GRAPHS;

APPROXIMATION RESULTS; ASYMMETRIC TRAVELLING SALESMAN PROBLEMS; CYCLE COVERS; MINIMUM WEIGHT; SHORTEST SUPERSTRING PROBLEM; SYMMETRICS; TIME-OPTIMAL; UNDIRECTED GRAPH;

DIRECTED GRAPHS;

EID: 85098633775     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.1994.365696     Document Type: Conference Paper

References (16)

1. C. Armen and C. Stein. A 2|-approximation algorithm for the shortest superstring problem, May 1994. Unpublished manuscript.
2. A. I. Barvinok. Two algorithmic results for the traveling salesman problem, April 1994. Unpublished manuscript.
3. A. Blum, T. Jiang, M. Li, J. Tromp, and M. Yannakakis. Linear approximation of shortest superstrings. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, New Orleans, LA, May 6-8, 1991, pages 328-336. ACM Press, New York, 1991.
4. N. Christofides. Worst-case analysis of a new heuristic for the travelling salesman problem. Report 388, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA, 1976.
5. A. Czumaj, L. Gasieniec, M. Piotrow, and W. Rytter. Parallel and sequential approximation of shortest superstrings. In SWAT 94: Proceedings of the 4th Scandinavian Workshop on Algorithm Theory, Aarhus, Denmark, July 6-8, 1994, pages 95-106. Springer-Verlag, Berlin, 1994.
6. M. L. Fisher, G. L. Nemhauser, and L. A. Wolsey. An analysis of approximations for finding a maximum weight hamiltonian circuit. Operations Research, 27(4):799-809, 1979.
7. A. M. Frieze, G. Galbiati, and F. Maffioli. On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks, 12(l):23-39, 1982.
8. J. Gallant, D. Maier, and J. Storer. On finding minimal length superstrings. Journal of Computer and System Sciences, 20(l):50-58, 1980.
9. D. B. Hartvigsen. Extensions of Matching Theory. PhD thesis, Carnegie Mellon University, Pittsburgh, PA, 1984.
10. R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85-103. Plenum Press, New York, 1972.
11. C. H. Papadimitriou and M. Yannakakis. The traveling salesman problem with distances one and two. Mathematics of Operations Research, 18(1):1-11, 1993.
12. S. Sahni and T. Gonzalez. P-complete approximation problems. Journal of the ACM, 23(3):555-565, 1976.
13. J. Tarhio and E. Ukkonen. A greedy approximation algorithm for constructing shortest common superstrings. Theoretical Computer Science, 57(1):131-145, 1988.
14. S.-H. Teng and F. Yao. Approximating shortest superstrings. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, Palo Alto, CA, November 3-5, 1993, pages 158-165. IEEE Computer Society Press, Los Alamitos, CA, 1993.
15. J. Turner. Approximation algorithms for the shortest common superstring problem. Information and Computation, 83(l):l-20, 1989.
16. V. G. Vizing. On an estimate of the chromatic class of a p-graph. Diskretnyi Analiz, 3:25-30, 1964. In Russian.