Abstract
We present a randomized algorithm to approximate the feedback arc set problem on weighted tournaments, a classic well-studied NP-hard problem. Our algorithm is based on rounding its standard linear programming relaxation. It improves the previously best-known LP rounding algorithm by achieving an approximation factor of 2.127 (best known was 2.5). As a result, we have found a better upper bound for the integrality gap of the corresponding LP.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call