Author:
Angel Eric,Bampis Evripidis,Pollatos Gerasimos G.,Zissimopoulos Vassilis
Subject
General Computer Science,Theoretical Computer Science
Reference16 articles.
1. Ivan D. Baev, Rajmohan Rajaraman, Approximation algorithms for data placement in arbitrary networks, in: Proceedings of the ACM-SIAM Annual Symposium on Discrete Algorithms, SODA, 2001, pp. 661–670.
2. Approximation algorithms for data placement problems;Baev;SIAM J. Comput.,2008
3. Jon Feldman, Matthias Ruhl, The directed steiner network problem is tractable for a constant number of terminals, in: 40th Annual Symposium on Foundations of Computer Science, 1999, pp. 299–308.
4. The directed steiner network problem is tractable for a constant number of terminals;Feldman;SIAM J. Comput.,2006
5. Integer Programming;Garfinkel,1973
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献