Author:
Goranci Gramoz,Räcke Harald
Publisher
Springer International Publishing
Reference19 articles.
1. Alon, N., Schieber, B.: Optimal preprocessing for answering on-line product queries. Technical report, Tel Aviv University (1987)
2. Andersen, R., Feige, U.: Interchanging distance and capacity in probabilistic mappings. CoRR, arXiv:abs/0907.3631 (2009)
3. Andoni, A., Gupta, A., Krauthgamer, R.: Towards (1+ $$\varepsilon $$ )-approximate flow sparsifiers. In: Proceedings of the 25th SODA, pp. 279–293 (2014)
4. Benczúr, A.A., Karger, D.R.: Approximating s-t minimum cuts in Õ(n $${}^{\text{2}}$$ ) time. In: Proceedings of the 28th STOC, pp. 47–55 (1996)
5. Chekuri, C., Shepherd, F.B., Oriolo, G., Scutellà, M.G.: Hardness of robust network design. Networks 50(1), 50–54 (2007)