1. Arora, S., Chakaravarthy, V., Gupta, K., Gupta, N., Sabharwal, Y.: Replica placement on directed acyclic graphs. In: Raman, V., Suresh, S. (eds.) Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS), pp. 213–225 (2014)
2. Arora, S., Chakaravarthy, V., Gupta, N., Mukherjee, K., Sabharwal, Y.: Replica placement via capacitated vertex cover. In: Seth, A., Vishnoi, N., (eds.) Proceedings of the 33rd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pp. 263–274 (2013)
3. Benoit, A., Larchevêque, H., Renaud-Goud, P.: Optimal algorithms and approximation algorithms for replica placement with distance constraints in tree networks. In: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 1022–1033 (2012)
4. Bodlaender, H., Koster, A.: Combinatorial optimization on graphs of bounded treewidth. Computer Journal 51(3), 255–269 (2008)
5. Chuzhoy, J., Naor, J.: Covering problems with hard capacities. SIAM Journal of Computing 36(2), 498–515 (2006)