Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
An approximation algorithm for the generalized assignment problem
Mathematical Programming: Series A and B
Approximation schemes for scheduling
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Improved bicriteria existence theorems for scheduling
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Convex quadratic and semidefinite programming relaxations in scheduling
Journal of the ACM (JACM)
Fairness in routing and load balancing
Journal of Computer and System Sciences - Special issue on Internet algorithms
All-Norm Approximation Algorithms
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Load balancing in the L/sub p/ norm
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
All-norm approximation algorithms
Journal of Algorithms
Convex programming for scheduling unrelated parallel machines
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Approximation Algorithms for Scheduling on Multiple Machines
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Dependent rounding and its applications to approximation algorithms
Journal of the ACM (JACM)
Machine scheduling with resource dependent processing times
Mathematical Programming: Series A and B
Truthful mechanism design for multi-dimensional scheduling via cycle monotonicity
Proceedings of the 8th ACM conference on Electronic commerce
Unrelated parallel machine scheduling with resource dependent processing times
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Operations Research Letters
Concentration inequalities for nonlinear matroid intersection
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Online scheduling with general cost functions
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Generalized machine activation problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Multi-budgeted matchings and matroid intersection via dependent rounding
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Algorithms for hub label optimization
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
We develop a single rounding algorithm for scheduling on unrelated parallel machines; this algorithm works well with the known linear programming-, quadratic programming-, and convex programming-relaxations for scheduling to minimize completion time, makespan, and other well-studied objective functions. This algorithm leads to the following applications for the general setting of unrelated parallel machines: (i) a bicriteria algorithm for a schedule whose weighted completion-time and makespan simultaneously exhibit the current-best individual approximations for these criteria; (ii) better-than-two approximation guarantees for scheduling to minimize the Lp norm of the vector of machine-loads, for all 1 p any given collection of integer Lp norms. Our algorithm has a natural interpretation as a melding of linear-algebraic and probabilistic approaches. Via this view, it yields a common generalization of rounding theorems due to Karp et al. [1987] and Shmoys & Tardos [1993], and leads to improved approximation algorithms for the problem of scheduling with resource-dependent processing times introduced by Grigoriev et al. [2007].