scientific article
From MaRDI portal
Publication:3686457
zbMath0569.90089MaRDI QIDQ3686457
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
estimationtravelling salesmanapproximate algorithmHamiltonian cycle of maximal lengthspanning set of simple loops
Related Items
Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem ⋮ Differential approximation results for the traveling salesman and related problems ⋮ Parameterized and approximation algorithms for finding two disjoint matchings ⋮ A polynomial algorithm with asymptotic ratio $2/3$ for the asymmetric maximization version of the $m$-PSP ⋮ Maximum travelling salesman problem. I ⋮ Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems ⋮ A better differential approximation ratio for symmetric TSP ⋮ Deterministic 7/8-Approximation for the Metric Maximum TSP ⋮ A 0.5358-approximation for Bandpass-2 ⋮ Approximate algorithms for the traveling salesman problem. II ⋮ On the maximum TSP with \(\gamma\)-parameterized triangle inequality ⋮ Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights ⋮ An Approximation Algorithm for the Maximum Traveling Salesman Problem ⋮ Consistent sets of secondary structures in proteins ⋮ A Polynomial 3/5-Approximate Algorithm for the Asymmetric Maximization Version of the 3-PSP ⋮ Deterministic 7/8-approximation for the metric maximum TSP ⋮ Improved deterministic approximation algorithms for max TSP ⋮ Reoptimization of minimum and maximum traveling salesman's tours ⋮ A \(\frac78\)-approximation algorithm for metric Max TSP ⋮ Informative path planning as a maximum traveling salesman problem with submodular rewards ⋮ Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings ⋮ Better approximations for max TSP ⋮ Approximating the maximum quadratic assignment problem ⋮ Differential approximation results for the traveling salesman problem with distances 1 and 2
