Two approximation algorithms for 3-cycle covers

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

Volumn 2462, Issue , 2002, Pages 40-50

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

^a UNIVERSITY OF LÜBECK   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; DIRECTED GRAPHS; GRAPH STRUCTURES; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

EDGE WEIGHTS; LOWER BOUNDS; NODE-DISJOINT CYCLES; NON NEGATIVES; OPTIMIZATION PROBLEMS; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; POLYNOMIAL-TIME; TRIANGLE INEQUALITY;

APPROXIMATION ALGORITHMS;

EID: 84956991107     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45753-4_6     Document Type: Conference Paper

References (16)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
2. P. Alimonti and V. Kann. Some APX-completeness results for cubic graphs. Theoret. Comput. Sci., 237(1-2):123–134, 2000.
3. M. Bläser and B. Siebert. Computing cycle covers without short cycles. In Proc. 9th Ann. European Symp. on Algorithms (ESA), volume 2161 of Lecture Notes in Comput. Sci., pages 368–379. Springer, 2001.
4. G. P. Cornuéjols and W. R. Pulleyblank. A matching problem with side conditions. Discrete Math., 29:135–159, 1980.
5. J. Edmonds. Paths, trees, and flowers. Canad. J. Math., 17:449–467, 1965.
6. A. M. Frieze, G. Galbiati, and F. Maffioli. On the worst-case performance of some algorithms for the traveling salesman problem. Networks, 12(1):23–39, 1982.
7. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
8. R. L. Graham, M. Grötschel, and L. Lovász, editors. Handbook of Combinatorics, volume 1. Elsevier, 1995.
9. D. Hartvigsen. An Extension of Matching Theory. PhD thesis, Carnegie-Mellon University, 1984.
10. D. Hartvigsen. The square-free 2-factor problem in bipartite graphs. In Proc. 7th Int. Conf. on Integer Programming and Combinatorial Optimization (IPCO), volume 1620 of Lecture Notes in Comput. Sci., pages 234–241. Springer, 1999.
11. M. Lewenstein and M. Sviridenko. A 5/8 approximation algorithm for the asymmetric maximum TSP. Manuscript, 2002.
12. L. Lovász and M. D. Plummer. Matching Theory. Elsevier, 1986.
13. C. H. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. J. Comput. System Sci., 43(3):425–440, 1991.
14. A. I. Serdyukov. An algorithm with an estimate for the traveling salesman problem of the maximum. Upravlyaemye Sistemy, 25:80–86, 1984. (in Russian).
15. W. T. Tutte. A short proof of the factor theorem for finite graphs. Canad. J. Math., 6:347–352, 1954.
16. L. G. Valiant. The complexity of computing the permanent. Theoret. Comput. Sci., 8(2):189–201, 1979.