Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Lecture Notes in Computer Science;M. Alicherry,2003
2. Lecture Notes in Computer Science;M. Andrews,2004
3. Andrews, M., Zhang, L.: Bounds on fiber minimization in optical networks. In: Proc. of IEEE INFOCOM (2005)
4. Buchsbaum, A., Karloff, H., Kenyon, C., Reingold, N., Thorup, M.: Opt versus load in dynamic storage allocation. In: Proc. of STOC 2003 (2003)
5. Lecture Notes in Computer Science;C. Chekuri,2003
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Busy-Time Scheduling on Heterogeneous Machines: Algorithms and Analysis;IEEE Transactions on Parallel and Distributed Systems;2022-12-01
2. Dynamic Bin Packing with Predictions;Proceedings of the ACM on Measurement and Analysis of Computing Systems;2022-12
3. Generalized Skyline Interval Coloring and Dynamic Geometric Bin Packing Problems;50th International Conference on Parallel Processing;2021-08-09
4. Analysis of Busy-Time Scheduling on Heterogeneous Machines;Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures;2021-07-06
5. Interval Job Scheduling With Machine Launch Cost;IEEE Transactions on Parallel and Distributed Systems;2020-12-01