A 2-approximation algorithm for the metric 2-peripatetic salesman problem
From MaRDI portal
Publication:3115183
Recommendations
- A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem
- Approximating the metric 2-peripatetic salesman problem
- Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2
- Approximation algorithms for solving the 2-peripatetic salesman problem on a complete graph with edge weights 1 and 2
- scientific article; zbMATH DE number 6007907
Cited in
(13)- A polynomial 3/5-approximate algorithm for the asymmetric maximization version of the 3-PSP
- Approximating the metric 2-peripatetic salesman problem
- Sensitivity analysis for symmetric 2-peripatetic salesman problems
- Approximability of the problem about a minimum-weight cycle cover of a graph
- An asymptotically optimal algorithm for the \(m\)-peripatetic salesman problem on random inputs with discrete distribution
- \(7/5\)-approximation algorithm for 2-PSP on minimum with different weight functions
- scientific article; zbMATH DE number 6007907 (Why is no real title available?)
- Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2
- A polynomial algorithm with asymptotic ratio \(2/3\) for the asymmetric maximization version of the \(m\)-PSP
- A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem
- A polynomial algorithm with approximation ratio 2/3 for the Asymmetric Maximum 2-Peripatetic Salesman Problem
- On the generalized 2-peripatetic salesman problem
- Approximation algorithms for 2-PSP-2W-max and 2-CC-2W-max
This page was built for publication: A 2-approximation algorithm for the metric 2-peripatetic salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115183)
