Anne Benoit, Hubert Larchevêque, Paul Renaud-Goud. Optimal Algorithms and Approximation Algorithms for Replica Placement with Distance Constraints in Tree Networks. In 26th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2012, Shanghai, China, May 21-25, 2012. pages 1022-1033, IEEE Computer Society, 2012. [doi]
@inproceedings{BenoitLR12,
title = {Optimal Algorithms and Approximation Algorithms for Replica Placement with Distance Constraints in Tree Networks},
author = {Anne Benoit and Hubert Larchevêque and Paul Renaud-Goud},
year = {2012},
doi = {10.1109/IPDPS.2012.95},
url = {http://doi.ieeecomputersociety.org/10.1109/IPDPS.2012.95},
researchr = {https://researchr.org/publication/BenoitLR12},
cites = {0},
citedby = {0},
pages = {1022-1033},
booktitle = {26th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2012, Shanghai, China, May 21-25, 2012},
publisher = {IEEE Computer Society},
isbn = {978-1-4673-0975-2},
}