scientific article
From MaRDI portal
Publication:3115273
zbMath1249.90300MaRDI QIDQ3115273
D. Zh. Zambalaeva, Alekseĭ Nikolaevich Glebov
Publication date: 20 February 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
traveling salesman problempolynomial algorithmguaranteed approximation ratio2-peripatetic salesman problemmax TSP
Related Items (5)
A polynomial algorithm with asymptotic ratio $2/3$ for the asymmetric maximization version of the $m$-PSP ⋮ An asymptotically optimal algorithm for the m-Peripatetic Salesman Problem on random inputs with discrete distribution ⋮ Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph ⋮ A Polynomial 3/5-Approximate Algorithm for the Asymmetric Maximization Version of the 3-PSP ⋮ A polynomial algorithm with approximation ratio 2/3 for the Asymmetric Maximum 2-Peripatetic Salesman Problem
This page was built for publication: