A better than “best possible” algorithm to edge color multigraphs
Journal of Algorithms
Structure of a simple scheduling polyhedron
Mathematical Programming: Series A and B
Scheduling to minimize average completion time: off-line and on-line approximation algorithms
Mathematics of Operations Research
On chromatic sums and distributed resource allocation
Information and Computation
Approximation algorithms for data placement on parallel disks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On algorithms for efficient data migration
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A systematic scheme to resolve qos dissatisfaction for storage cluster
NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
Improved bounds for sum multicoloring and scheduling dependent jobs with minsum criteria
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Minimal cost reconfiguration of data placement in storage area network
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Improved algorithms for data migration
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
Minimal cost reconfiguration of data placement in a storage area network
Theoretical Computer Science
A reliability optimization method for RAID-structured storage systems based on active data migration
Journal of Systems and Software
| Hi-index | 0.00 |