Author:
Gimadi E. Kh.,Tsidulko O. Yu.
Subject
Mathematics (miscellaneous)
Reference27 articles.
1. A. Adamaszek, P. Chalermsook, A. Ene, and A. Wiese, “Submodular unsplittable flow on trees,” Math. Program. 172, 565–589 (2018).
https://doi.org/10.1007/s10107-017-1218-4
2. A. A. Ageev, “A criterion of polynomial-time solvability for the network location problem,” in Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, Pittsburgh, PA, USA, 1992 (Carnegie Mellon Univ., Pittsburgh, 1992), pp. 237–245.
3. K. Andreev, C. Garrod, D. Golovin, B. Maggs, and A. Meyerson, “Simultaneous source location,” ACM Trans. Algorithms 6 (1), article 16 (2010).
https://doi.org/10.1145/1644015.1644031
4. K. Arata, S. Iwata, K. Makino, and S. Fujishige, “Locating sources to meet flow demands in undirected networks,” J. Algorithms 42, 54–68 (2002).
https://doi.org/10.1006/jagm.2001.1203
5. Lecture Notes in Computer Science;MA Bender,2000
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献