activity
20112026
most citedDecomposable Submodular Function Minimization: Discrete and Continuous

15 citations · 42 across the 16 of their papers we have counts for

collaborators
Showing 2017 · cs.DSShow all

1 paper · 2 filters

cs.DS2017

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

Ola Svensson, Jakub Tarnawski, László A. Végh

We give a constant-factor approximation algorithm for the asymmetric traveling salesman problem (ATSP). Our approximation guarantee is analyzed with respect to the standard LP rela…