Author:
Khandekar Rohit,Pandit Vinayaka
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Andrews, M., Bender, M., Zhang, L.: New algorithms for disc scheduling. Algorithmica 32(2), 277–301 (2002)
2. Bar-Yehuda, R., Laserson, J.: 9-approximation algorithm for the sorting buffers problem. In: 3rd Workshop on Approximation and Online Algorithms (2005)
3. Bartal, Y.: Probabilistic approximations of metric spaces and its algorithmic applications. In: IEEE Symposium on Foundations of Computer Science, pp. 184–193 (1996)
4. Charikar, M., Khuller, S., Raghavachari, B.: Algorithms for capacitated vehicle routing. SIAM Journal of Computing 31, 665–682 (2001)
5. Charikar, M., Raghavachari, B.: The finite capacity dial-a-ride problem. In: IEEE Symposium on Foundations of Computer Science, pp. 458–467 (1998)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Online Service with Delay;ACM Transactions on Algorithms;2021-08
2. The reordering buffer problem on the line revisited;ACM SIGACT News;2018-03-14
3. Online service with delay;Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing;2017-06-19
4. An Improved Competitive Algorithm for Reordering Buffer Management;ACM Transactions on Algorithms;2015-06-23
5. Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities;Automata, Languages, and Programming;2015