Computing cycle covers without short cycles

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2161, Issue , 2001, Pages 368-379

  Bläser, Markus ^a   Siebert, Bodo ^a  

^a UNIVERSITY OF LÜBECK   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS; GRAPH STRUCTURES; POLYNOMIAL APPROXIMATION;

DECISION PROBLEMS; DIRECTED PATHS; EDGE WEIGHTS; MINIMIZATION PROBLEMS; MINIMUM WEIGHT; POLYNOMIAL-TIME; TRAVELLING SALESPERSON PROBLEMS; UNDIRECTED GRAPH;

APPROXIMATION ALGORITHMS;

EID: 84943244356     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44676-1_31     Document Type: Conference Paper

References (19)

1. M. Ajtai. Recursive construction for 3-regular expanders. Combinatorica, 14(4):379-416, 1994.
2. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and Approximation. Springer, 1999.
3. G. Cornuéjols andW. Pulleyblank. Amatching problem with side constraints. Discrete Math., 29:135-159, 1980.
4. J. Edmonds. Paths, trees, and flowers. Canad. J. Math., 17:449-467, 1965.
5. L. Engebretsen and M. Karpinski. Approximation hardness of TSP with bounded metrics. Technical Report 00-089, Electronic Colloquium on Comput. Complexity (ECCC), 2000.
6. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to NP-Completeness. W. H. Freeman and Company, 1979.
7. R. L. Graham, M. Grötschel, and L. Lovász, editors. Handbook of Combinatorics, volume 1. Elvsevier, 1995.
8. D. Hartvigsen. An Extension of Matching Theory. PhD thesis, Carnegie-Mellon University, 1984.
9. D. Hartvigsen. The square-free 2-factor problem in bipartite graphs. In 7th Int. Conf. on Integer Programming and Combinatorial Optimization (IPCO), volume 1620 of Lecture Notes in Comput. Sci., pages, 234-241. Springer, 1999.
10. J. Håstad. Some optimal inapproximability results. In Proc. 29th Ann. Symp. on Theory of Comput. (STOC), pages, 1-10. ACM, 1997.
11. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
12. S. R. Kosaraju, J. K. Park, and C. Stein. Long tours and short superstrings. In Proc. 35th Ann. Symp. on Foundations of Comput. Sci. (FOCS), pages, 166-177. IEEE, 1994.
13. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, editors. The Traveling Salesman Problem. Wiley, 1985.
14. L. Lovász and M. D. Plummer. Matching Theory. Elsevier, 1986.
15. C. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, 1982.
16. C. H. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. J. Comput. System Sci., 43(3):425-440, 1991.
17. C. H. Papadimitriou and M. Yannakakis. The traveling salesman problem with distances one and two. Math. Oper. Res., 18:1-11, 1993.
18. W. T. Tutte. A short proof of the factor theorem for finite graphs. Canad. J. Math., 6:347-352, 1954.
19. S. Vishwanathan. An approximation algorithm for the asymmetric travelling salesman problem with distances one and two. Inform. Process. Lett., 44:297-302, 1992.