Approximation-Friendly Discrepancy Rounding
Abstract
Rounding linear programs using techniques from discrepancy is a recent approach that has been very successful in certain settings. However this method also has some limitations when compared to approaches such as randomized and iterative rounding. We provide an extension of the discrepancy-based rounding algorithm due to Lovett-Meka that (i) combines the advantages of both randomized and iterated rounding, (ii) makes it applicable to settings with more general combinatorial structure such as matroids. As applications of this approach, we obtain new results for various classical problems such as linear system rounding, degree-bounded matroid basis and low congestion routing.
Cite
@article{arxiv.1512.02254,
title = {Approximation-Friendly Discrepancy Rounding},
author = {Nikhil Bansal and Viswanath Nagarajan},
journal= {arXiv preprint arXiv:1512.02254},
year = {2016}
}
Comments
21 pages, 1 figure. The final version of this paper is due to be published in the collection of papers "A Journey through Discrete Mathematics. A Tribute to Jiri Matousek" edited by Martin Loebl, Jaroslav Nesetril and Robin Thomas, due to be published by Springer