Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 74-83

  Csaba, Béla ^a   Karpinski, Marek ^b   Krysta, Piotr ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; HARDNESS;

APPROXIMABILITY; APPROXIMATION RATIOS; FOLLOWING PROBLEM; HARDNESS RESULT; INAPPROXIMABILITY; INTEGRALITY GAPS; LP RELAXATION; MAXIMUM DEGREE 3;

GRAPH THEORY;

EID: 38149139869     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (34)

1. N. Alon, R. Duke, H. Leftman, V. Rodl and R. Yuster. The algorithmic aspects of the regularity lemma. J. Algorithms, 16, 80-109, 1994. Prelim, ver. in Proc. 33rd FOCS, 1992.
2. N. Alon, R. Yuster and U. Zwick. Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs. In Proc. 26th ACM STOC, 326-335, 1994.
3. S. Arora, D.R. Karger and M. Karpinski. Polynomial time approximation schemes for dense instances of NP-hard problems. In Proc. ACM STOC, 284-293, 1995.
4. C. Bazgan, M. Santha and Z. Tuza. On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs. In Proc. 15th STACS, LNCS, 1998.
5. R. Carr and R. Ravi. A new bound for the 2-edge connected subgraph problem. In Proc. 6th IPCO, LNCS 1412, 1998.
6. J. Cheriyan, A. Sebo and Z. Szigeti. An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs. In Proc. 6th IPCO, LNCS 1412, 126-136, 1998.
7. A. Czumaj and A. Lingas. On approximability of the minimum-cost k-connected spanning subgraph problem. In Proc. 10th ACM-SIAM SODA, 281-290, 1999.
8. E. Dahlhaus, P. Hajnal and M. Karpinski. On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs. J. Algorithms, 15, 367-384, 1993.
9. R. Diestel. Graph Theory. Springer, N.Y., 1997.
10. L. Engebretsen. An explicit lower bound for TSP with distances one and two. In Proc. 16th STACS, LNCS, 1563, 373-382, 1999.
11. L. Engebretsen and M. Karpinski. Approximation hardness of TSP with bounded metrics. In the Proc. 28th ICALP, LNCS, 2001.
12. C.G. Fernandes. A better approximation ratio for the minimum size k-edge-connected spanning subgraph problem. J. Algorithms, 28, 105-124, 1998. Prelim, ver. in Proc. 8th SODA, 1997.
13. W. Fernandez de la Vega and M. Karpinski. On the approximation hardness of dense TSP and other path problems. Information Processing Letters, 70, 53-55, 1999.
14. A. Frank. Conservative weightings and ear decompositions of graphs. Combinatorica, 13, 65-81, 1993.
15. A. Frieze and R. Kannan. The Regularity Lemma and Approximation Schemes for Dense Problems, in Proc. 37th FOCS, 12-20, 1996.
16. N. Garg, A. Singla, and S. Vempala. Improved Approximation Algorithms for Biconnected Subgraphs via Better Lower Bounding Techniques. In Proc. 4th SODA, 103-111, 1993.
17. M.X. Goemans. Worst-case Comparison of Valid Inequalities for the TSP. Math. Programming, 69, 335-349, 1995.
18. M-X. Goemans, D.J. Bertsimas. Survivable networks, linear programming relaxations and the parsimonious property. Math. Programming, 60, 145-166, 1993.
19. R.L. Graham, M. Grotschel and L. Lovasz (Eds.) Handbook of Combinatorics. Vol. I. North-Holland, 1995.
20. D. Karger, R. Motwani and G. Ramkumar. On Approximating the Longest Path in a Graph. Algorithmica, 18, 82-98, 1997.
21. R.M. Karp. Reducibility among Combinatorial Problems. In Complexity of Computer Computations, R.E. Miller & J.W. Thatcher (Eds.), Plenum, New York, 1972.
22. M. Karpinski. Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Problems. Algorithmica, 30, 386-397, 2001.
23. M. Karpinski. Approximating Bounded Degree Instances of NP-hard Problems. In Proc. 13th Symp. Fundamentals of Comp. Theory (FCT), LNCS, 2138, 2001.
24. S. Khuller and U. Vishkin. Biconnectivity Approximations and Graph Carvings. J. ACM, 41(2), 214-235, 1994. Prelim, ver. in Proc. 24th ACM STOC, 1992.
25. J. Komlos, G.N. Sarkozy and E. Szemerédi. Blow-up Lemma. Combinatorica, 17(1), 109-123, 1997.
26. J. Komlos, G.N. Sarkozy and E. Szemerédi. An algorithmic version of the Blow-up Lemma. Random Struct. & Algorithms, 12, 297-312, 1998.
27. J. Komlos and M. Simonovits. Szemerédi's Regularity Lemma and its applications in graph theory. DJMACS Tech. Rep. 96-10, 1996.
28. P. Krysta and V. S. Anil Kumar. Approximation Algorithms for Minimum Size 2-Connectivity Problems. In Proc. 18th STACS, LNCS, 2010, 431-442, 2001.
29. CL. Monma, S.B. Munson, and W.R. Pulleyblank. Minimum-weight two-connected spanning networks. Math. Programming, 46, 153-171, 1990.
30. C.H. Papadimitriou and M. Yannakakis. The Traveling Salesman Problem With Distances One and Two. Math, of Oper. Res., 18, 1-11, 1993.
31. E. Szemerédi. Regular partitions of graphs. In Colloques Internationaux C.N.R.S. No. 260. Problèmes Combina-toires et Théorie des Graphes, Orsay, 399-401, 1976.
32. S. Vempala and A. Vetta. Factor 4/3 Approximations for Minimum 2-Connected Subgraphs. In Proc. 3rd Workshop APPROX, LNCS, 1913, 262-273, 2000.
33. S. Vishwanathan. An approximation algorithm for the asymmetric travelling salesman problem with distances one and two. Inf. Proc. Lett., 44, 297-302, 1992.
34. S. Vishwanathan. An Approximation Algorithm for Finding a Long Path in Hamiltonian Graphs. In Proc. 11th SODA, 680-695, 2000.