Funder
NSERC
Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada
FONDECYT
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference17 articles.
1. Bley, A., Rezapour, M.: Combinatorial approximation algorithms for buy-at-bulk connected facility location problems. Discrete Appl. Math. 213, 34–46 (2016)
2. Chekuri, C., Khanna, S., Naor, J.S.: A deterministic algorithm for the cost-distance problem. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 232–233 (2001)
3. Eisenbrand, F., Grandoni, F., Rothvoß, T., Schäfer, G.: Connected facility location via random facility sampling and core detouring. J. Comput. Syst. Sci. 76(8), 709–726 (2010)
4. Friggstad, Z., Rezapour, M., Salavatipour, M.R., Soto, J.A.: LP-based approximation algorithms for facility location in buy-at-bulk network design. In: Proceedings of the 14th International Symposium on Algorithms and Data Structures (WADS), pp. 373–385 (2015)
5. Garg, N., Khandekar, R., Konjevod, G., Ravi, R., Salman, F.S., Sinha, A.: On the integrality gap of a natural formulation of the single-sink buy-at-bulk network design problem. In: Proceedings of Integer Programming and Combinatorial Optimization (IPCO), pp. 170–184 (2001)