Publisher
Springer Nature Switzerland
Reference9 articles.
1. Carr, R.D., Fleischer, L.K., Leung, V.J., Phillips, C.A.: Strengthening integrality gaps for capacitated network design and covering problems. Technical report, Sandia National Lab. (SNL-NM), Albuquerque, NM, USA; Sandia ... (1999)
2. Chakrabarty, D., Chekuri, C., Khanna, S., Korula, N.: Approximability of capacitated network design. Algorithmica 72, 493–514 (2015)
3. Holzhauser, M., Krumke, S.O., Thielen, C.: Budget-constrained minimum cost flows. J. Comb. Optim. 31(4), 1720–1745 (2016)
4. Holzhauser, M., Krumke, S.O., Thielen, C.: A network simplex method for the budget-constrained minimum cost flow problem. Eur. J. Oper. Res. 259(3), 864–872 (2017)
5. Holzhauser, M., Krumke, S.O., Thielen, C.: On the complexity and approximability of budget-constrained minimum cost flows. Inf. Process. Lett. 126, 24–29 (2017)