Abstract
We consider the maximum traveling salesman problem (Max TSP) and the maximum m-peripatetic salesman problem (Max m-PSP) on assuming that the vertices of a graph lie in some geometric space. For the both problems we obtain approximation algorithms that find asymptotically optimal solutions in the case of a normed space with a bounded dimension and in the case of a polyhedral space with a bounded number of facets, respectively.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
