A maiden analysis of Longest Wait First
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Approximating the average response time in broadcast scheduling
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
A maiden analysis of longest wait first
ACM Transactions on Algorithms (TALG)
Approximation Algorithms for Scheduling on Multiple Machines
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A robust maximum completion time measure for scheduling
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Improved approximation algorithms for broadcast scheduling
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
ACM SIGACT News
Dependent rounding and its applications to approximation algorithms
Journal of the ACM (JACM)
Positive Influence and Negative Dependence
Combinatorics, Probability and Computing
Broadcast scheduling: algorithms and complexity
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Mathematics of Operations Research
An improved approximation algorithm for vertex cover with hard capacities
Journal of Computer and System Sciences
An improved approximation algorithm for vertex cover with hard capacities
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Randomly rounding rationals with cardinality constraints and derandomizations
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
An online scalable algorithm for average flow time in broadcast scheduling
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Energy efficient scheduling via partial shutdown
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Broadcast scheduling: Algorithms and complexity
ACM Transactions on Algorithms (TALG)
Approximation of Partial Capacitated Vertex Cover
SIAM Journal on Discrete Mathematics
Generating randomized roundings with cardinality constraints and derandomizations
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Off-line algorithms for minimizing total flow time in broadcast scheduling
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Randomized rounding for routing and covering problems: experiments and improvements
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
A primal-dual approximation algorithm for partial vertex cover: making educated guesses
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Online scalable scheduling for the lk-norms of flow time without conservation of work
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Roundings respecting hard constraints
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
LP rounding and an almost harmonic algorithm for scheduling with resource dependent processing times
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Capacitated domination: constant factor approximations for planar graphs
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Journal of Discrete Algorithms
Energy-Efficient scheduling with time and processors eligibility restrictions
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
| Hi-index | 0.00 |
We combine the pipage rounding technique of Ageev & Sviridenko with a recent rounding method developed by Srinivasan, to develop a new randomized rounding approachfor fractional vectors defined on the edge-sets of bipartite graphs. We show various ways of combining this technique with other ideas, leading to the following applications:richer random-graph models for graphs with a given degree-sequence;improved approximation algorithms for: (i) throughput-maximization in broadcast scheduling, (ii) delay-minimization in broadcast scheduling, and (iii) capacitated vertex cover;fair scheduling of jobs on unrelated parallel machines.A useful feature of our method is that it lets us prove certain (probabilistic) per-user fairness properties.