Asymptotically optimal algorithms for geometric Max TSP and Max m-PSP

Authors:
V. V. Shenmaier
Affiliations:
-
Venue:
Discrete Applied Mathematics
Year:
2014

Citing 3
Cited 0

Simplicity and hardness of the maximum traveling salesman problem under geometric distances

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
The geometric maximum traveling salesman problem

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.04

Visualization

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.