Author:
Peis Britta,Skutella Martin,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, 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. Busch, C., Magdon-Ismail, M., Xi, J.: Optimal oblivious path selection on the mesh. IEEE Transactions on Computers 57, 660–671 (2008)
5. Fleischer, L., Skutella, M.: Minimum cost flows over time without intermediate storage. In: Proceedings of the 14th Annual Symposium on Discrete Algorithms (2003)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献