Approximation Algorithms for the Maximum m-Peripatetic Salesman Problem.
Edward Kh. GimadiOxana Yu. TsidulkoPublished in: AIST (2017)
Keyphrases
- approximation algorithms
- special case
- np hard
- worst case
- vertex cover
- minimum cost
- facility location problem
- network design problem
- integrality gap
- constant factor
- approximation ratio
- np hardness
- set cover
- open shop
- exact algorithms
- primal dual
- undirected graph
- randomized algorithms
- constant factor approximation
- approximation schemes
- polynomial time approximation
- disjoint paths
- optimal solution
- genetic algorithm