scientific article; zbMATH DE number 1305423

zbMath0944.90104MaRDI QIDQ4252306

Sándor P. Fekete

Publication date: 26 September 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Hamiltonian cyclepolynomial timeNP-hardnesstravelling salesman tour

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60)

Related Items (7)

Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension ⋮ Long non-crossing configurations in the plane ⋮ The lazy bureaucrat scheduling problem ⋮ A hybrid mathematical model for flying sidekick travelling salesman problem with time windows ⋮ Asymptotically optimal algorithms for geometric MAX TSP and MAX \(m\)-PSP ⋮ Lengths of tours and permutations on a vertex set of a convex polygon. ⋮ On the longest spanning tree with neighborhoods

This page was built for publication: