Showing 1–20 of 45 results
/ Date/ Name
Nov 23, 2011Directed Steiner Tree and the Lasserre HierarchyJun 12, 2018A Fourier-Analytic Approach for the Discrepancy of Random Set SystemsJul 7, 2022Approximate Carathéodory bounds via Discrepancy TheoryOct 29, 2022The Vector Balancing Constant for ZonotopesNov 7, 2022From approximate to exact integer programmingApr 24, 2011The Entropy Rounding Method in Approximation AlgorithmsJul 4, 2016Lecture Notes on the ARV Algorithm for Sparsest CutJan 4, 2025A parameterized linear formulation of the integer hullMar 26, 2023The Subspace Flatness Conjecture and Faster Integer ProgrammingJul 19, 2013Polynomiality for Bin Packing with a Constant Number of Item TypesJul 2, 2011Extended formulations for polygonsJun 17, 2012A simpler proof for O(congestion + dilation) packet routingDec 15, 2010Set Covering with Ordered Replacement -- Additive and Multiplicative GapsApr 30, 2011Some 0/1 polytopes need exponential size extended formulationsApr 20, 20120/1 Polytopes with Quadratic Chvatal RankNov 30, 2011Matroids and Integrality Gaps for Hypergraphic Steiner Tree RelaxationsApr 18, 2010Prizing on Paths: A PTAS for the Highway ProblemJul 13, 2010Bin Packing via Discrepancy of PermutationsApr 21, 2020Scheduling with Communication Delays via LP Hierarchies and ClusteringJan 17, 2013Approximating Bin Packing within O(log OPT * log log OPT) bins