Constant factor approximation for ATSP with two edge weights.
Ola SvenssonJakub TarnawskiLászló A. VéghPublished in: Math. Program. (2018)
Keyphrases
- edge weights
- constant factor approximation
- approximation algorithms
- np hard
- undirected graph
- traveling salesman problem
- weighted graph
- bipartite graph
- shortest path
- spanning tree
- directed graph
- closest string
- minimum cost
- satisfy the triangle inequality
- special case
- superpixels
- directed acyclic graph
- graph cuts
- combinatorial optimization
- bayesian networks
- random walk
- worst case