Server Scheduling in the Weighted ℓ p Norm-Reference-Cited by-同舟云学术

Server Scheduling in the Weighted ℓ p Norm

Published:2004 Issue: Volume: Page:434-443
ISSN:0302-9743
Container-title:LATIN 2004: Theoretical Informatics
language:
Short-container-title:

Author:

Bansal Nikhil,Pruhs Kirk

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-24698-5_47

Reference15 articles.

1. Afrati, F., Bampis, E., Chekuri, C., Karger, D., Kenyon, C., Khanna, S., Milis, I., Queyranne, M., Skutella, M., Stein, C., Sviridenko, M.: Approximation Schemes for Minimizing AverageWeighted Completion Time with Release Dates. In: Foundations of Computer Science (FOCS), pp. 32–44 (1999)

2. Bansal, N., Dhamdhere, K.: Minimizing Weighted Flow Time. In: ACM/SIAM Symposium on Discrete Algorithms (SODA), pp. 508–516 (2003)

3. Bansal, N., Pruhs, K.: Server scheduling in the L p norm: a rising tide lifts all boats. In: ACM Symposium on Theory of Computing (STOC), pp. 242–250 (2003)

4. Becchetti, L., Leonardi, S.: Non-Clairvoyant Scheduling to Minimize the Average Flow Time on Single and Parallel Machines. In: ACM Symposium on Theorey of Computing, STOC (2001)

5. Lecture Notes in Computer Science;L. Becchetti,2001

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A PTAS for Minimizing Weighted Flow Time on a Single Machine;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

2. Competitive Kill-and-Restart and Preemptive Strategies for Non-clairvoyant Scheduling;Integer Programming and Combinatorial Optimization;2023

3. The efficiency-fairness balance of Round Robin scheduling;Operations Research Letters;2022-01

4. Approximation Schemes for Packing Problems with $$\ell _p$$-norm Diversity Constraints;LATIN 2022: Theoretical Informatics;2022

5. A (2 + ε )-approximation algorithm for preemptive weighted flow time on a single machine;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15