Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
Approximability and nonapproximability results for minimizing total flow time on a single machine
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Approximation algorithms for scheduling
Approximation algorithms for NP-hard problems
Optimal time-critical scheduling via resource augmentation (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Scheduling to minimize average completion time: off-line and on-line approximation algorithms
Mathematics of Operations Research
Approximating the throughput of multiple machines under real-time scheduling
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Scheduling to minimize average completion time: off-line and on-line algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Improved approximation algorthims for scheduling with release dates
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Approximation techniques for average completion time scheduling
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Flow and stretch metrics for scheduling continuous job streams
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
An experimental study of LP-based approximation algorithms for scheduling problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
SIAM Journal on Discrete Mathematics
Scheduling Jobs that Arrive Over Time (Extended Abstract)
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Improved Scheduling Algorithms for Minsum Criteria
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Random-Based Scheduling: New Approximations and LP Lower Bounds
RANDOM '97 Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science
Scheduling-LPs Bear Probabilities: Randomized Approximations for Min-Sum Criteria
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
A unified approach to approximating resource allocation and scheduling
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Buffer overflow management in QoS switches
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Improved Approximation Algorithms for Resource Allocation
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximation Algorithms for the Unsplittable Flow Problem
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
A quasi-PTAS for unsplittable flow on line graphs
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
A truthful mechanism for value-based scheduling in cloud computing
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Pricing on paths: a PTAS for the highway problem
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Near-optimal scheduling mechanisms for deadline-sensitive jobs in large computing clusters
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Online optimization of busy time on parallel machines
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
A logarithmic approximation for unsplittable flow on line graphs
ACM Transactions on Algorithms (TALG)
A Truthful Mechanism for Value-Based Scheduling in Cloud Computing
Theory of Computing Systems
| Hi-index | 0.00 |