Discrepancy of set-systems and matrices
European Journal of Combinatorics
An efficient approximation scheme for variable-sized bin packing
SIAM Journal on Computing
Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
Fast approximation algorithms for fractional packing and covering problems
Mathematics of Operations Research
An exact duality theory for semidefinite programming and its complexity implications
Mathematical Programming: Series A and B
Semidefinite programming in combinatorial optimization
Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
Approximate graph coloring by semidefinite programming
Journal of the ACM (JACM)
Balancing vectors and Gaussian measures of n-dimensional convex bodies
Random Structures & Algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Combinatorics, Probability and Computing
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
Journal of Computer and System Sciences - STOC 2001
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Dependent rounding and its applications to approximation algorithms
Journal of the ACM (JACM)
On allocations that maximize fairness
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A fast asymptotic approximation scheme for bin packing with rejection
Theoretical Computer Science
An efficient approximation scheme for the one-dimensional bin-packing problem
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Approximation algorithms for scheduling unrelated parallel machines
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
An APTAS for Generalized Cost Variable-Sized Bin Packing
SIAM Journal on Computing
Bin packing problems with rejection penalties and their dual problems
Information and Computation
Bin Packing with Rejection Revisited
Algorithmica
An improved LP-based approximation for steiner tree
Proceedings of the forty-second ACM symposium on Theory of computing
An O(log n/ log log n)-approximation algorithm for the asymmetric traveling salesman problem
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Constructive Algorithms for Discrepancy Minimization
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
The train delivery problem: vehicle routing meets bin packing
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
The Design of Approximation Algorithms
The Design of Approximation Algorithms
Set covering with ordered replacement: additive and multiplicative gaps
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Iterative Methods in Combinatorial Optimization
Iterative Methods in Combinatorial Optimization
AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items
SIAM Journal on Optimization
Multi-budgeted matchings and matroid intersection via dependent rounding
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Bin packing with rejection revisited
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Hi-index | 0.00 |
Let A be a matrix, c be any linear objective function and x be a fractional vector, say an LP solution to some discrete optimization problem. Then a recurring task in theoretical computer science (and in approximation algorithms in particular) is to obtain an integral vector y such that Ax ≈ Ay and cTy exceeds cTx by only a moderate factor. We give a new randomized rounding procedure for this task, provided that A has bounded Δ-approximate entropy. This property means that for uniformly chosen random signs χ(j) ε {±1} on any subset of the columns, the outcome Aχ can be approximately described using at most m/5 bits in expectation (with m being the number of selected columns). To achieve this result, we modify well-known techniques from the field of discrepancy theory, especially we rely on Beck's entropy method, which to the best of our knowledge has never been used before in the context of approximation algorithms. Our result can be made constructive using the Bansal framework based on semidefinite programming. We demonstrate the versatility of our procedure by rounding fractional solutions to column-based linear programs for some generalizations of Bin Packing. For example we obtain a polynomial time OPT + O(log2 OPT) approximation for Bin Packing With Rejection and the first AFPTAS for the Train Delivery problem.