Skip to main content
SpringerLink
Log in
Book cover

International Conference on Current Trends in Theory and Practice of Computer Science

SOFSEM 1997: SOFSEM'97: Theory and Practice of Informatics pp 70–85Cite as

Solving and approximating combinatorial optimization problems (Towards MAX CUT and TSP)

  • Invited Papers
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1338))

Abstract

We present a brief outline of recent development of combinatorial optimization. We concentrate on relaxation methods, on polynomial approximate results and on mutual relationship of various combinatorial optimization problems. We believe that this complex web of results and methods is typical for the modern combinatorial optimization. This paper is an introduction to our full paper [53].

Partially supported by GAČR 0194 and GAUK 194 grants.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D.Applegate, R.Bixby, V.Chvátal, W.Cook: Finding cuts in the TSP. DIMACS Tech. Report, 95–105.

    Google Scholar 

  2. S.Arora: Polynomial time approximation schemes for Euclidean TSP and other geometric problems. In: Proc. of the 37th IEEE FOCS, 1966.

    Google Scholar 

  3. S.Arora, C.Lund, R.Motwani, M.Sudan, M.Szegedy: Proof verification and intractability of approximation problems. 33rd FOCS, 1992, 14-23.

    Google Scholar 

  4. S.Arora, S.Safra: Probabilistic checking of proofs: a new characterization of NP. 33rd FOGS, 1992, 2-13.

    Google Scholar 

  5. E.Balas, V.Chvital, J.Nešeřil: On the maximum weight clique problem. J. of Oper. Research (1985).

    Google Scholar 

  6. F.Barahona: On cuts and matchings in planar graphs. Mathematical Programming 60 (1993),53–68.

    Google Scholar 

  7. R.E.Bland, D.F.Shallcross: Large travelling salesman problems arising from experiments in X-ray crystalography: a preliminary report on computation. Oper.Res.Lett. 8 (1989),125–128.

    Google Scholar 

  8. O.Boruvka: O jistém problému minimálním (about a certain minimal problem). Práce mor. přírodovéd. spol. v Brné III, 3 (1926), 37–58.

    Google Scholar 

  9. N.Christofides: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report, Carnegie-Mellon University, 1976.

    Google Scholar 

  10. V.Chv'atal: Edmonds polytopes and hierarchy of combinatorial problems. Discrete Math. 4 (1973), 305–337.

    Google Scholar 

  11. V.Chvátal: On certain polytopes associated with graphs, J.Comb.Th. B, 18 (1975), 138–154.

    Google Scholar 

  12. H.Crowder, M.W.Padberg: Solving large-scale symmetric travelling salesman problems to optimality. Management Sci 26 (1980), 495–509.

    Google Scholar 

  13. W.McCuaig, N.Robertson, P.D.Seymour, R.Thomas: Permanents, Pffafian orientations and even directed circuits. (to appear; see also a preliminary version in STOCK (1997)).

    Google Scholar 

  14. G.B.Dantzig, D.R.Fulkerson, S.M.Johnson: Solution of large-scale travelling salesman problem, Oper.Res. 2 (1954), 393–410.

    Google Scholar 

  15. C.Delorme, S.Poljak: Laplacian eigenvalues and the max-cut problem. Mathematical Programming 63 (1993), 557–574.

    Google Scholar 

  16. T.Feder, M.Vardi: Monotonne monadic SNP and constraint satisfaction. Proceedings of the 25th ACM STOC, ACM, 1993.

    Google Scholar 

  17. W.Fernandez de la Vega, G.S.Lueker: Bin packing can be solved within 1 + ɛ in linear time. Combinatorica 1 (1981), 349–355.

    Google Scholar 

  18. U.Fiege, S.Goldwasser, L.Lovisz, S.Safra, M.Szegedy: Interactive proofs and the hardness of approximating cliques. Journal of the ACM 43 (1966), 268–292.

    Google Scholar 

  19. A.Galluccio, M.Loebl: Even cycles and H-homomorphismus. (to appear)

    Google Scholar 

  20. M.R.Garey, D.S.Johnson: The complexity of near optimal coloring. J. Assoc. Comput. Math. 23 (1976), 43–49.

    Google Scholar 

  21. M.Goemans, D.Williamson:.878-approximation algorithm for Max-Cut and Max2-SAT. 25th STOC, 1994, 422–431.

    Google Scholar 

  22. M.Goemans, D.Williamson: Improved approximation algorithm for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM 42 (1995),1115–1145.

    Google Scholar 

  23. R.E.Gomory: Outline of an algorithm for integer solutions to linear programs. Bull. Amer. Math. Soc. 64 (1958), 275–278.

    Google Scholar 

  24. R.L.Graham: Bounds for certain multiprocessing anomalities. Bell System Tech. J. 45 (1969),1563–1581.

    Google Scholar 

  25. R.L.Graham, P.Hell: On the history of the minimum spanning tree problem. Annals of the History of Computing 7 (1985), 43–57.

    Google Scholar 

  26. M.Grötschel, O.Holland: Solution of large-scale symmetric travelling salesman problems. Math.Programing 51 (1991),141–202.

    Google Scholar 

  27. M.Grötschel, L.Lovisz, A.Schrijver: Geometric algorithms and combinatorial optimization. Springer Verlag, 1988.

    Google Scholar 

  28. J.Hastad: Some optimal inapproximability results. In: Proceedings 29th STOC (1997), 1–10.

    Google Scholar 

  29. P.Hell, J.Nešetřil: On the complexity of H-coloring. J.Comb.Th. B, 48 (1990), 92–110.

    Google Scholar 

  30. P.Hell, J.Nešetřil, X.Zhu: Duality and polynomial testing of graph homomorphism. Trans.Amer.Math.Soc. 348, 4 (1996), 1281–1297.

    Google Scholar 

  31. V.Jarník: O jistém problému minimálním (about a certain minimal problem). Price mor. přírodovéd. spol. v Brné IV, 4 (1930), 57–63.

    Google Scholar 

  32. M.Jünger, G.Reinelt, S.Thienel: Practical problems solving with cutting plane algorithms. In: Combinatorial Optimization (W.Cook, L.Lovász, P.Seymour, ed.), DIMACS Series vol.20, AMS(1995), 111–152.

    Google Scholar 

  33. G.Kalai: A subexponential randomized simplex algorithm. Proc. 24th STOCK, 1992,475–482.

    Google Scholar 

  34. D.Karger, P.N.Klein, R.E.Tarjan: A randomized linear-time algorithm to find minimum spanning trees. J.Assoc.Comp.Mach. 42 (1995), 321–328.

    Google Scholar 

  35. M.Karpinski, A.Zelikovsky: New approximation algorithms for the Steiner tree problems. Technical Report ECCC TR95-030, 1995.

    Google Scholar 

  36. P.W.Kasteleyn: Graph theory and crystal physics. In: Graph Theory and Theoretical Physics (F.Harary, ed.), Academic Press, New York, 1967, 43–110.

    Google Scholar 

  37. A.Kehrbaum, B.Korte: Calculi. West Deutcher Verlag, 1995.

    Google Scholar 

  38. S.Khanna, M.Sudan, D.P.Williamson: A complete classification of the approximability of maximization problems derived from Boolean constraint satisfaction. In: Proceedings 29th STOC (1997), 11–20.

    Google Scholar 

  39. V.Klee, R.Ladner, R.Mauber: Sign-solvability revisited. Linear Algebra Appl. 59 (1984),131–158.

    Google Scholar 

  40. J.Komlos: Linear verification for spanning trees. Combinatorica 5 (1985), 57–65.

    Google Scholar 

  41. B.Korte, L.Lovász, R.Schrader: Greedoids. Springer 1990.

    Google Scholar 

  42. B.Korte, J.Nešetřil: Vojtéch Jarník's work in combinatorial optimization. KAM Series 95, 315.

    Google Scholar 

  43. J.B.Kruskal: On the shortest spanning subtree of a graph and the travelling salesman problem. Proc.Amer.Math.Soc. 7 (1856), 48–50.

    Google Scholar 

  44. M.Laurent, S.Poljak, F.Rendl: Connections between semidefinite relaxation of the Max Cut and Stable Set Problems. (to appear)

    Google Scholar 

  45. E.L.Lawler, J.K.Lenstra, A.H.G.Rinnooy Kan, D.B.Shmoys: The travelling salesman problem. John Wiley, 1985.

    Google Scholar 

  46. L.Lovász: On the Shannon capacity of a graph. IEEE Transactions on Information Theory 25 (1979), 1–7.

    Google Scholar 

  47. L.Lovász: Randomized algorithms in combinatorial optimization. In: Combinatorial optimization (ed. W.Cook, L.Lovász, P.Seymour), DIMACS Series vol. 20, AMS 1995, 153–180.

    Google Scholar 

  48. L.Lovász, A.Schrijver: Cones of matrices and set-functions and 0-1 optimization. Siam Journal of Optimization 1 (1991), 166–190.

    Google Scholar 

  49. L.Lovász, M.Plummer: Matching Theory. North Holland 1986.

    Google Scholar 

  50. J.Matoušek, M.Sharir, E.Welzl: A subexponential bound for linear programming, Proc. 8th Ann.Symp. on Comput. Geom. (1992),1–8.

    Google Scholar 

  51. J.Nešetřil: A few remarks on the history of MST-problem. Archivum Mathematicum 33 (1997), 16–22.

    Google Scholar 

  52. J.Nešetřil, S.Poljak: Geomatrical and algebraical connections of combinatorial optimization. SOFSEM '80, Bratislava 1980, 35–78.

    Google Scholar 

  53. J.Nešetřil, D.Turzík Solving and approximating Combinatorial Optimization Problems. (to appear).

    Google Scholar 

  54. M.W.Padberg, G.Rinaldi: Facet identification for the symmetric travelling salesman polytope. Math.Programming 47 (1990), 219–257.

    Google Scholar 

  55. C.H.Papadimitriou: Euclidean TSP is NP-complete. Theoretical Computer Science 4 (1977),237–244.

    Google Scholar 

  56. C.H.Papadimitriou, M.Yannakakis: Optimization, approximation and complexity classes. Journal of Computer and System Sciences 43 (1991), 425–440.

    Google Scholar 

  57. S.Poljak, D.Turzík: A polynomial algorithm for constructing a large bipartite subgraph with an application to satisfiability problem. Canadian Math. J. 24 (1982), 519–524.

    Google Scholar 

  58. S.Poljak, D.Turziík: Maximum cut and circulant graphs. Discrete Math. 108 (1992), 379–392.

    Google Scholar 

  59. S.Poljak, Zs.Tuza: Maximum cuts and largest bipartite subgraphs. In: Combinatorial Optimization (W.Cook, L.Lovász, P.Seymour, ed.), DIMACS Series vol.20, AMS(1995), 181–244.

    Google Scholar 

  60. P.Pudlák: Lower bounds for resolution and cutting plane proofs and monotonne computations. J. Symbol. Logic (to appear).

    Google Scholar 

  61. G.Reinelt: TSPLIB-A travelling salesman problem library. ORSA J.Computing 3 (1991),376–384.

    Google Scholar 

  62. G.Reinelt: Fast heuristics for large geometric travelling salesman problems. ORSA J.Comput. 4 (1992), 206–217.

    Google Scholar 

  63. D.B.Shmoys: Computing near-optimal solution to combinatorial optimization problems. In: Combinatorial Optimization (W. Cook, L.Lovász, P.Seymour, ed.), DIMACS Series vol.20, AMS(1995), 355–398.

    Google Scholar 

  64. T.Schaefer: The complexity of satisfiability problems. Proceedings of the 10th ACM STOC, ACM, 1978.

    Google Scholar 

  65. P.Seymour: On the two coloring of hypergraphs. Quart.J.Math. Oxford 25 (1975), 303–312.

    Google Scholar 

  66. R.E.Tarjan: Data structures and network algorithms. CBMS-NSF Regional Conf. Series in Applied Math., SIAM 44, 1983.

    Google Scholar 

  67. L.Trevisan: When Hamming meets Euclid: The approximability of geometric TSP and MST. In: Proceedings 29th STOC (1997), 21-29.

    Google Scholar 

  68. L.G.Valiant: The complexity of computing the permanent. Theoret.Comp.Sci. 8 (1979),189–201.

    Google Scholar 

  69. D.Welsh: Matroid theory. Academic Press 1976.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Charles University, Malostránské nám. 25, 118 00, Praha 1, Czech Republic

    Jaroslav Nešetřil

  2. Department of Mathematics, Institute of Chemistry and Technology, Technická 5, 166 28, Praha 6, Czech Republic

    Daniel Turzí'k

Authors
  1. Jaroslav Nešetřil
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daniel Turzí'k
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

František Plášil Keith G. Jeffery

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nešetřil, J., Turzí'k, D. (1997). Solving and approximating combinatorial optimization problems (Towards MAX CUT and TSP). In: Plášil, F., Jeffery, K.G. (eds) SOFSEM'97: Theory and Practice of Informatics. SOFSEM 1997. Lecture Notes in Computer Science, vol 1338. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63774-5_98

Download citation

  • DOI: https://doi.org/10.1007/3-540-63774-5_98

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63774-5

  • Online ISBN: 978-3-540-69645-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation