The value of strong inapproximability results for clique
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
New approaches to covering and packing problems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Non-independent randomized rounding
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation Algorithms for the Unsplittable Flow Problem
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Non-independent Randomized Rounding and an Application to Digital Halftoning
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Using the Pseudo-Dimension to Analyze Approximation Algorithms for Integer Programming
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Using Randomized Rounding to Satisfy Timing Constraints of Real-Time Preemptive Tasks
ASP-DAC '02 Proceedings of the 2002 Asia and South Pacific Design Automation Conference
Approximating covering integer programs with multiplicity constraints
Discrete Applied Mathematics
On the approximability of clique and related maximization problems
Journal of Computer and System Sciences
Approximation techniques for utilitarian mechanism design
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Approximation algorithms for covering/packing integer programs
Journal of Computer and System Sciences
Non-independent randomized rounding and coloring
Discrete Applied Mathematics - Special issue: Efficient algorithms
Algorithmic construction of sets for k-restrictions
ACM Transactions on Algorithms (TALG)
Truthful unsplittable flow for large capacity networks
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Approximation algorithms for stochastic and risk-averse optimization
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Infrastructure Leasing Problems
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
A Θ( logn)-approximation for the set cover problem with set ownership
Information Processing Letters
Online Primal-Dual Algorithms for Covering and Packing
Mathematics of Operations Research
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Distributed and parallel algorithms for weighted vertex cover and other covering problems
Proceedings of the 28th ACM symposium on Principles of distributed computing
Non-independent randomized rounding and coloring
Discrete Applied Mathematics - Special issue: Efficient algorithms
Truthful unsplittable flow for large capacity networks
ACM Transactions on Algorithms (TALG)
Dynamic programming based algorithms for set multicover and multiset multicover problems
Theoretical Computer Science
Energy efficient scheduling via partial shutdown
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Thresholded covering algorithms for robust and max-min optimization
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Inapproximability of b-matching in k-uniform hypergraphs
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Approximation schemes for deal splitting and covering integer programs with multiplicity constraints
Theoretical Computer Science
Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Online primal-dual algorithms for covering and packing problems
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Generalized machine activation problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Greedy approximation via duality for packing, combinatorial auctions and routing
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Approximation schemes for deal splitting and covering integer programs with multiplicity constraints
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
The lovász-local-lemma and scheduling
Efficient Approximation and Online Algorithms
An experimental study of the misdirection algorithm for combinatorial auctions
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
On column-restricted and priority covering integer programs
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
On k-column sparse packing programs
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Approximation Techniques for Utilitarian Mechanism Design
SIAM Journal on Computing
Efficient submodular function maximization under linear packing constraints
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Approximating sparse covering integer programs online
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Approximating the min-max (regret) selecting items problem
Information Processing Letters
| Hi-index | 0.00 |
Several important NP-hard combinatorial optimization problems can be posed as packing/covering integer programs; the randomized rounding technique of Raghavan and Thompson is a powerful tool with which to approximate them well. We present one elementary unifying property of all these integer linear programs and use the FKG correlation inequality to derive an improved analysis of randomized rounding on them. This yields a pessimistic estimator, thus presenting deterministic polynomial-time algorithms for them with approximation guarantees that are significantly better than those known.