Author:
Caramia Massimiliano,Sgalambro Antonino
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference16 articles.
1. M. Andrews, L. Zhang, Hardness of the undirected congestion minimization problem, in: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005
2. On the k-splittable flow problem;Baier;Algorithmica,2005
3. J. Chuzhoy, J. Naor, New hardness results for congestion minimization and machine scheduling, in: Proceedings of the 36th Annual ACM Symposium of Theory of Computing, Chicago, IL, 2004, pp. 28–34
4. On the single-source unsplittable flow problem;Dinitz;Combinatorica,1999
5. Implementing approximation algorithms for single-source unsplittable flow;Du,2004
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献