\(7/5\)-approximation algorithm for 2-PSP on minimum with different weight functions
From MaRDI portal
Publication:890881
zbMath1329.90120MaRDI QIDQ890881
A. V. Gordeeva, D. Zh. Zambalaeva, Alekseĭ Nikolaevich Glebov
Publication date: 16 November 2015
Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)
Full work available at URL: http://semr.math.nsc.ru/v8/p296-309.pdf
traveling salesman problempolynomial algorithmguaranteed approximation ratio2-peripatetic salesman problem
Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (3)
A polynomial algorithm with asymptotic ratio $2/3$ for the asymmetric maximization version of the $m$-PSP ⋮ 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
This page was built for publication: \(7/5\)-approximation algorithm for 2-PSP on minimum with different weight functions
