An improved approximation algorithm for the ATSP with parameterized triangle inequality

Explore this paper's citation graph

Summary

An approximation algorithm is devised which is better than both [email protected]@[email-protected]^3 and @[email protected] for almost all @[ email protected)?[12,1).

Type
article
Published
2009-04-01
Cited by
10
References
11

Keywords

Triangle inequality, Combinatorics, Parameterized complexity, Travelling salesman problem, Mathematics

References

Cited by

Related papers