Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Avrahami, N., Azar, Y.: Minimizing total flow time and total completion time with immediate dispatching. In: SPAA, pp. 11–18. ACM, New York (2003)
2. Awerbuch, B., Azar, Y., Leonardi, S., Regev, O.: Minimizing the flow time without migration. In: STOC, pp. 198–205 (1999)
3. Bansal, N., Chan, H.-L.: Weighted flow time does not admit o(1)-competitive algorithms. In: SODA, pp. 1238–1244 (2009)
4. Bansal, N., Chan, H.-L., Pruhs, K.: Speed scaling with an arbitrary power function. In: SODA 2009: Proceedings of the Nineteenth Annual ACM -SIAM Symposium on Discrete Algorithms, Philadelphia, PA, USA, pp. 693–701. Society for Industrial and Applied Mathematics (2009)
5. Bansal, N., Dhamdhere, K.: Minimizing weighted flow time. ACM Transactions on Algorithms 3(4) (2007)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Minimizing Maximum Flow-Time on Related Machines;Theory of Computing;2016
2. Minimizing Flow-Time on Unrelated Machines;Proceedings of the forty-seventh annual ACM symposium on Theory of Computing;2015-06-14