Shorter tours by nicer ears: 7/5-Approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs.
András SeböJens VygenPublished in: Comb. (2014)
Keyphrases
- connected subgraphs
- traveling salesman problem
- weighted graph
- directed acyclic graph
- biological networks
- edge weights
- connected components
- shortest path
- undirected graph
- strongly connected
- optimization problems
- combinatorial optimization
- graph theory
- approximation algorithms
- biological data
- minimum cost
- ant colony optimization
- random walk
- np hard
- quasi cliques
- databases
- image segmentation