Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2.
Alexey BaburinFederico Della CroceEdward GimadiY. V. GlazkovVangelis Th. PaschosPublished in: Discret. Appl. Math. (2009)
Keyphrases
- approximation algorithms
- edge weights
- undirected graph
- spanning tree
- minimum cost
- weighted graph
- np hard
- bipartite graph
- special case
- shortest path
- worst case
- directed graph
- vertex cover
- minimum weight
- approximation ratio
- minimum spanning tree
- superpixels
- directed acyclic graph
- constant factor
- multiscale
- state space
- training set