Author:
Karpov Nikolai,Pilipczuk Marcin,Zych-Pawlewicz Anna
Funder
H2020 European Research Council
Government of the Russian Federation
Warsaw Centre of Mathematics and Computer Science
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference11 articles.
1. Andoni, A., Gupta, A., Krauthgamer, R.: Towards
$$(1+\varepsilon )$$
(
1
+
ε
)
-approximate flow sparsifiers. In: Chekuri, C. (ed.) Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, 5–7 Jan 2014, pp. 279–293. SIAM (2014)
2. Chambers, E.W., Eppstein, D.: Flows in one-crossing-minor-free graphs. J. Gr. Algorithms Appl. 17(3), 201–220 (2013)
3. Chuzhoy, J.: On vertex sparsifiers with steiner nodes. In: Karloff, H.J., Pitassi, T. (eds.) Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, 19– 22 May 2012, pp. 673–688. ACM (2012)
4. Englert, M., Gupta, A., Krauthgamer, R., Räcke, H., Talgam-Cohen, I., Talwar, K.: Vertex sparsifiers: new results from old techniques. SIAM J. Comput. 43(4), 1239–1262 (2014)
5. Goranci, G., Henzinger, M., Peng, P.: Improved guarantees for vertex sparsification in planar graphs. In: Pruhs, K., Sohler, C. (eds.) 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), vol. 87, pp. 44:1–44:14. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik: Dagstuhl (2017)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献