Author:
Sanders Peter,Sivadasan Naveen,Skutella Martin
Publisher
Institute for Operations Research and the Management Sciences (INFORMS)
Subject
Management Science and Operations Research,Computer Science Applications,General Mathematics
Reference30 articles.
1. Afrati F., Bampis E., Chekuri C., Karger D., Kenyon C., Khanna S., Milis I., et al. Approximation schemes for minimizing average weighted completion time with release datesProc. 40th Annual IEEE Sympos. Foundations Comput. Sci.(1999) New York3243
2. Better Bounds for Online Scheduling
3. Online algorithms: a survey
4. Improved Bounds for On-Line Load Balancing
Cited by
76 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem;SIAM Journal on Discrete Mathematics;2024-02-09
2. Fully-Dynamic Load Balancing;Lecture Notes in Computer Science;2024
3. Bin stretching with migration on two hierarchical machines;Mathematical Methods of Operations Research;2023-07-19
4. Polylog-Competitive Algorithms for Dynamic Balanced Graph Partitioning for Ring Demands;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17
5. Online Unrelated-Machine Load Balancing and Generalized Flow with Recourse;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02