Non-independent randomized rounding
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Approximation Algorithms for the Partial Vertex Cover Problem
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Structural and algorithmic aspects of massive social networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for partial covering problems
Journal of Algorithms
Tight approximation algorithms for maximum general assignment problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Quorum placement in networks: minimizing network congestion
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Dependent rounding and its applications to approximation algorithms
Journal of the ACM (JACM)
Positive Influence and Negative Dependence
Combinatorics, Probability and Computing
Scheduling DAGs on asynchronous processors
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Improved algorithmic versions of the Lovász Local Lemma
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Budgeted Allocations in the Full-Information Setting
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Maximizing submodular set functions subject to multiple linear constraints
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Stream sampling for variance-optimal estimation of subset sums
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Optimal monitoring in multi-channel multi-radio wireless mesh networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Randomly rounding rationals with cardinality constraints and derandomizations
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Approximation of partial capacitated vertex cover
ESA'07 Proceedings of the 15th annual European conference on Algorithms
On quality of monitoring for multi-channel wireless infrastructure networks
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
Journal of Complexity
Negative dependence and srinivasan's sampling process
Combinatorics, Probability and Computing
Structure-aware sampling on data streams
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Structure-aware sampling on data streams
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
A closest vector problem arising in radiation therapy planning
Journal of Combinatorial Optimization
Approximation of Partial Capacitated Vertex Cover
SIAM Journal on Discrete Mathematics
Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums
SIAM Journal on Computing
Generating randomized roundings with cardinality constraints and derandomizations
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Randomized rounding for routing and covering problems: experiments and improvements
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Multi-budgeted matchings and matroid intersection via dependent rounding
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Approximation algorithms and hardness results for labeled connectivity problems
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Roundings respecting hard constraints
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Fault-tolerant facility location: a randomized dependent LP-Rounding algorithm
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
SIAM Journal on Computing
Journal of Discrete Algorithms
Strong robustness of randomized rumor spreading protocols
Discrete Applied Mathematics
Improved approximation algorithms for the Min-Max Selecting Items problem
Information Processing Letters
| Hi-index | 0.00 |
We consider a family of distributions on fixed-weight vectors in (0; 1)t these distributions enjoy certain negative correlation properties and also satisfy pre-specified conditions on their marginal distributions. We show the existence of such families, and present a linear-time algorithm to sample from them. This yields improved approximation algorithms for the following problems: (a) low-congestion multi-path routing; (b) maximum coverage versions of set cover; (c) partial vertex cover problems for bounded-degree graphs; and (d) the Group Steiner Tree problem. For (a) and (b), the improvement is in the approximation ratio; for (c), we show how to speedup existing approximation algorithms while preserving the best-known approximation ratio; we also improve the approximation ratio for certain families of instances of unbounded degree. For (d), we derive an approximation algorithm whose approximation guarantee is at least as good as what is known; our algorithm is shown to have a better approximation guarantee for the worst known input families for existing algorithms.