📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem (2017)

First Author: Svensson O

Attributed to: New strongly polynomial algorithms for network optimisation problems funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.48550/arxiv.1708.04215

Publication URI: https://arxiv.org/abs/1708.04215

Type: Preprint