scientific article; zbMATH DE number 3630482
From MaRDI portal
Publication:4191856
zbMath0405.90050MaRDI QIDQ4191856
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Greedy AlgorithmComputational ComplexityHeuristic AlgorithmSymmetric Travelling Salesman ProblemWorst-Case Behaviour
Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Eulerian and Hamiltonian graphs (05C45)
Related Items
Approximation algorithms for the Geometric Covering Salesman Problem, Strategies for Generating Well Centered Tetrahedral Meshes on Industrial Geometries, Truly tight bounds for TSP heuristics, Minimum-weight two-connected spanning networks, The approximation ratio of the greedy algorithm for the metric traveling salesman problem, Asymptotic expected performance of some TSP heuristics: An empirical evaluation, An extension of Christofides heuristic to the k-person travelling salesman problem, Worst-case analysis of two travelling salesman heuristics