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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
D.Applegate, R.Bixby, V.Chvátal, W.Cook: Finding cuts in the TSP. DIMACS Tech. Report, 95–105.
S.Arora: Polynomial time approximation schemes for Euclidean TSP and other geometric problems. In: Proc. of the 37th IEEE FOCS, 1966.
S.Arora, C.Lund, R.Motwani, M.Sudan, M.Szegedy: Proof verification and intractability of approximation problems. 33rd FOCS, 1992, 14-23.
S.Arora, S.Safra: Probabilistic checking of proofs: a new characterization of NP. 33rd FOGS, 1992, 2-13.
E.Balas, V.Chvital, J.Nešeřil: On the maximum weight clique problem. J. of Oper. Research (1985).
F.Barahona: On cuts and matchings in planar graphs. Mathematical Programming 60 (1993),53–68.
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.
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.
N.Christofides: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report, Carnegie-Mellon University, 1976.
V.Chv'atal: Edmonds polytopes and hierarchy of combinatorial problems. Discrete Math. 4 (1973), 305–337.
V.Chvátal: On certain polytopes associated with graphs, J.Comb.Th. B, 18 (1975), 138–154.
H.Crowder, M.W.Padberg: Solving large-scale symmetric travelling salesman problems to optimality. Management Sci 26 (1980), 495–509.
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)).
G.B.Dantzig, D.R.Fulkerson, S.M.Johnson: Solution of large-scale travelling salesman problem, Oper.Res. 2 (1954), 393–410.
C.Delorme, S.Poljak: Laplacian eigenvalues and the max-cut problem. Mathematical Programming 63 (1993), 557–574.
T.Feder, M.Vardi: Monotonne monadic SNP and constraint satisfaction. Proceedings of the 25th ACM STOC, ACM, 1993.
W.Fernandez de la Vega, G.S.Lueker: Bin packing can be solved within 1 + ɛ in linear time. Combinatorica 1 (1981), 349–355.
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.
A.Galluccio, M.Loebl: Even cycles and H-homomorphismus. (to appear)
M.R.Garey, D.S.Johnson: The complexity of near optimal coloring. J. Assoc. Comput. Math. 23 (1976), 43–49.
M.Goemans, D.Williamson:.878-approximation algorithm for Max-Cut and Max2-SAT. 25th STOC, 1994, 422–431.
M.Goemans, D.Williamson: Improved approximation algorithm for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM 42 (1995),1115–1145.
R.E.Gomory: Outline of an algorithm for integer solutions to linear programs. Bull. Amer. Math. Soc. 64 (1958), 275–278.
R.L.Graham: Bounds for certain multiprocessing anomalities. Bell System Tech. J. 45 (1969),1563–1581.
R.L.Graham, P.Hell: On the history of the minimum spanning tree problem. Annals of the History of Computing 7 (1985), 43–57.
M.Grötschel, O.Holland: Solution of large-scale symmetric travelling salesman problems. Math.Programing 51 (1991),141–202.
M.Grötschel, L.Lovisz, A.Schrijver: Geometric algorithms and combinatorial optimization. Springer Verlag, 1988.
J.Hastad: Some optimal inapproximability results. In: Proceedings 29th STOC (1997), 1–10.
P.Hell, J.Nešetřil: On the complexity of H-coloring. J.Comb.Th. B, 48 (1990), 92–110.
P.Hell, J.Nešetřil, X.Zhu: Duality and polynomial testing of graph homomorphism. Trans.Amer.Math.Soc. 348, 4 (1996), 1281–1297.
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.
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.
G.Kalai: A subexponential randomized simplex algorithm. Proc. 24th STOCK, 1992,475–482.
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.
M.Karpinski, A.Zelikovsky: New approximation algorithms for the Steiner tree problems. Technical Report ECCC TR95-030, 1995.
P.W.Kasteleyn: Graph theory and crystal physics. In: Graph Theory and Theoretical Physics (F.Harary, ed.), Academic Press, New York, 1967, 43–110.
A.Kehrbaum, B.Korte: Calculi. West Deutcher Verlag, 1995.
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.
V.Klee, R.Ladner, R.Mauber: Sign-solvability revisited. Linear Algebra Appl. 59 (1984),131–158.
J.Komlos: Linear verification for spanning trees. Combinatorica 5 (1985), 57–65.
B.Korte, L.Lovász, R.Schrader: Greedoids. Springer 1990.
B.Korte, J.Nešetřil: Vojtéch Jarník's work in combinatorial optimization. KAM Series 95, 315.
J.B.Kruskal: On the shortest spanning subtree of a graph and the travelling salesman problem. Proc.Amer.Math.Soc. 7 (1856), 48–50.
M.Laurent, S.Poljak, F.Rendl: Connections between semidefinite relaxation of the Max Cut and Stable Set Problems. (to appear)
E.L.Lawler, J.K.Lenstra, A.H.G.Rinnooy Kan, D.B.Shmoys: The travelling salesman problem. John Wiley, 1985.
L.Lovász: On the Shannon capacity of a graph. IEEE Transactions on Information Theory 25 (1979), 1–7.
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.
L.Lovász, A.Schrijver: Cones of matrices and set-functions and 0-1 optimization. Siam Journal of Optimization 1 (1991), 166–190.
L.Lovász, M.Plummer: Matching Theory. North Holland 1986.
J.Matoušek, M.Sharir, E.Welzl: A subexponential bound for linear programming, Proc. 8th Ann.Symp. on Comput. Geom. (1992),1–8.
J.Nešetřil: A few remarks on the history of MST-problem. Archivum Mathematicum 33 (1997), 16–22.
J.Nešetřil, S.Poljak: Geomatrical and algebraical connections of combinatorial optimization. SOFSEM '80, Bratislava 1980, 35–78.
J.Nešetřil, D.Turzík Solving and approximating Combinatorial Optimization Problems. (to appear).
M.W.Padberg, G.Rinaldi: Facet identification for the symmetric travelling salesman polytope. Math.Programming 47 (1990), 219–257.
C.H.Papadimitriou: Euclidean TSP is NP-complete. Theoretical Computer Science 4 (1977),237–244.
C.H.Papadimitriou, M.Yannakakis: Optimization, approximation and complexity classes. Journal of Computer and System Sciences 43 (1991), 425–440.
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.
S.Poljak, D.Turziík: Maximum cut and circulant graphs. Discrete Math. 108 (1992), 379–392.
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.
P.Pudlák: Lower bounds for resolution and cutting plane proofs and monotonne computations. J. Symbol. Logic (to appear).
G.Reinelt: TSPLIB-A travelling salesman problem library. ORSA J.Computing 3 (1991),376–384.
G.Reinelt: Fast heuristics for large geometric travelling salesman problems. ORSA J.Comput. 4 (1992), 206–217.
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.
T.Schaefer: The complexity of satisfiability problems. Proceedings of the 10th ACM STOC, ACM, 1978.
P.Seymour: On the two coloring of hypergraphs. Quart.J.Math. Oxford 25 (1975), 303–312.
R.E.Tarjan: Data structures and network algorithms. CBMS-NSF Regional Conf. Series in Applied Math., SIAM 44, 1983.
L.Trevisan: When Hamming meets Euclid: The approximability of geometric TSP and MST. In: Proceedings 29th STOC (1997), 21-29.
L.G.Valiant: The complexity of computing the permanent. Theoret.Comp.Sci. 8 (1979),189–201.
D.Welsh: Matroid theory. Academic Press 1976.
Author information
Authors and Affiliations
Editor information
Rights 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