Better approximation algorithms for bin covering
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
An asymptotic fully polynomial time approximation scheme for bin covering
Theoretical Computer Science
Approximation lower bounds in online LIB bin packing and covering
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the 13th Australasian workshop on combinatorial algorithms
The maximum resource bin packing problem
Theoretical Computer Science
Performance analysis of FlexRay-based ECU networks
Proceedings of the 44th annual Design Automation Conference
Performance bounds for peer-assisted live streaming
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Theoretical Computer Science
The maximum resource bin packing problem
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Comparing online algorithms for bin packing problems
Journal of Scheduling
| Hi-index | 0.00 |