Approximation-Friendly Discrepancy Rounding
From MaRDI portal
Publication:3186517
DOI10.1007/978-3-319-33461-5_31zbMath1419.90066arXiv1512.02254OpenAlexW2191437688MaRDI QIDQ3186517
Nikhil Bansal, Viswanath Nagarajan
Publication date: 10 August 2016
Published in: Integer Programming and Combinatorial Optimization, A Journey Through Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.02254
Related Items (3)
Approximation-Friendly Discrepancy Rounding ⋮ An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound ⋮ Approximating MIN-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On generalizations of network design problems with degree bounds
- New approaches to multi-objective optimization
- Discrepancy of set-systems and matrices
- Global wire routing in two-dimensional arrays
- ``Integer-making theorems
- On tail probabilities for martingales
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning
- Constructive Discrepancy Minimization for Convex Sets
- Discrepancy Without Partial Colorings
- The Design of Approximation Algorithms
- Iterative Methods in Combinatorial Optimization
- Approximation-Friendly Discrepancy Rounding
- Constructive Discrepancy Minimization by Walking on the Edges
- Degree Bounded Matroids and Submodular Flows
- Approximating minimum bounded degree spanning trees to within one of optimal
- Six Standard Deviations Suffice
- Approximating Hereditary Discrepancy via Small Width Ellipsoids
- Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach
- Geometric discrepancy. An illustrated guide
This page was built for publication: Approximation-Friendly Discrepancy Rounding
