Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A Journey Through Discrete MathematicsApproximation-Friendly Discrepancy Rounding

A Journey Through Discrete Mathematics: Approximation-Friendly Discrepancy Rounding [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.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

A Journey Through Discrete MathematicsApproximation-Friendly Discrepancy Rounding

Editors: Loebl, Martin; Nešetřil, Jaroslav; Thomas, Robin
Bansal, Nikhil; Nagarajan, Viswanath
Springer Journals — Oct 6, 2017
Download PDF
25 pages

Loading next page...
 
/lp/springer-journals/a-journey-through-discrete-mathematics-approximation-friendly-xk9gT2Oqng
Publisher
Springer International Publishing
Copyright
© Springer International publishing AG 2017
ISBN
978-3-319-44478-9
Pages
89 –114
DOI
10.1007/978-3-319-44479-6_4
Publisher site
See Chapter on Publisher Site

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.]

Published: Oct 6, 2017

There are no references for this article.