144 search results - page 3 / 29 » Improved Approximation Algorithms for Metric Max TSP |
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
88
Voted
JDA
2006
15 years 9 days ago
2006
We consider the asymmetric traveling salesperson problem with -parameterized triangle inequality for [1/2, 1). That means, the edge weights fulfill w(u, v)
99
Voted
WAOA
2005
Springer
15 years 5 months ago
2005
Springer
MAX SAT and MAX NAE-SAT are central problems in theoretical computer science. We present an approximation algorithm for MAX NAE-SAT with a conjectured performance guarantee of 0.82...
129
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
121
click to vote
CSC
2009
15 years 1 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...