On 2-capacitated peripatetic salesman problem with different weight functions

MaRDI QIDQ5741365zbMATH OpenFDO

Authors Eh. Kh. Gimadi, A. M. Istomin, I. A. Rykov

Publication date 22 July 2016

Full work available at URL http://mathnet.ru/eng/vngu341

zbMATH Keywords

\(m\)-peripatetic salesman problemapproximation algorithmedge-disjoint Hamiltonian cyclesguarantee approximation ratiotravelling salesman problem

Mathematics Subject Classification ID

Graph polynomials (05C31) Eulerian and Hamiltonian graphs (05C45) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Programming involving graphs or networks (90C35)

Recommendations

• On the \(m\)-capacitated peripatetic salesman problem with capacity restrictions
• Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2
• The undirected \(m\)-capacitated peripatetic salesman problem
• Approximation algorithms for the maximum 2-peripatetic salesman problem
• Approximation algorithms for solving the 2-peripatetic salesman problem on a complete graph with edge weights 1 and 2

Cited in

(3)

• On the generalized 2-peripatetic salesman problem
• The undirected \(m\)-capacitated peripatetic salesman problem
• On the \(m\)-capacitated peripatetic salesman problem with capacity restrictions

This page was built for publication: On 2-capacitated peripatetic salesman problem with different weight functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5741365)