Sciweavers

APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
14 years 1 months ago
A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem
A long-standing conjecture in Combinatorial Optimization is that the integrality gap of the Held-Karp LP relaxation for the Asymmetric Traveling Salesman Problem (ATSP) is a consta...
Thành Nguyen