Constant Factor Approximation for ATSP with Two Edge Weights - (Extended Abstract).
Ola SvenssonJakub TarnawskiLászló A. VéghPublished in: IPCO (2016)
Keyphrases
- extended abstract
- edge weights
- constant factor approximation
- approximation algorithms
- weighted graph
- undirected graph
- np hard
- bipartite graph
- traveling salesman problem
- spanning tree
- satisfy the triangle inequality
- shortest path
- minimum cost
- directed graph
- closest string
- special case
- superpixels
- worst case
- triangle inequality
- pairwise
- lower bound
- multiple images
- geodesic distance
- link prediction
- markov random field
- scheduling problem