Login / Signup
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems.
Markus Bläser
L. Shankar Ram
Maxim Sviridenko
Published in:
Oper. Res. Lett. (2009)
Keyphrases
</>
approximation algorithms
vertex cover
np hard
randomized algorithms
approximation schemes
special case
np hardness
worst case
minimum cost
exact algorithms
open shop
constant factor
network design problem
set cover
approximation ratio
precedence constraints
practical problems
branch and bound
optimization problems