Author:
Peis Britta,Wiese Andreas
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Adler, M., Khanna, S., Rajaraman, R., Rosén, A.: Time-constrained scheduling of weighted packets on trees and meshes. Algorithmica 36, 123–152 (2003)
2. Adler, M., Sitaraman, R., Rosenberg, A., Unger, W.: Scheduling time-constrained communication in linear networks. In: Proceedings of the 10th annual ACM symposium on Parallel Algorithms and Architectures (SPAA 1998), pp. 269–278 (1998)
3. Busch, C., Magdon-Ismail, M., Mavronicolas, M., Spirakis, P.: Direct routing: Algorithms and complexity. Algorithmica 45, 45–68 (2006)
4. di Ianni, M.: Efficient delay routing. Theoretical Computer Science 196, 131–151 (1998)
5. Fleischer, L., Skutella, M.: Minimum cost flows over time without intermediate storage. In: Proceedings of the 14th Annual Symposium on Discrete Algorithms, SODA 2003 (2003)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Two Exact Algorithms for the Packet Scheduling Problem;Combinatorial Optimization and Applications;2023-12-09
2. Network Coding Gaps for Completion Times of Multiple Unicasts;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11
3. The Moser--Tardos Framework with Partial Resampling;Journal of the ACM;2019-09-28
4. Near-Optimal Scheduling of Distributed Algorithms;Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing;2015-07-21
5. O(log m)-approximation for the routing open shop problem;RAIRO - Operations Research;2015-01-19