Author:
Bérczi Kristóf,Chandrasekaran Karthekeyan,Király Tamás,Madan Vivek
Funder
Hungarian National Research, Development and Innovation Office
New National Excellence Program of the Ministry of Human Capacities
National Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference16 articles.
1. Bérczi, K., Chandrasekaran, K., Király, K., Lee, E., Xu, C.: Global and fixed-terminal cuts in digraphs. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM). Leibniz International Proceedings in Informatics (LIPIcs), vol. 81, pp. 2:1–2:20 (2017)
2. Bernáth, A., Pap, G.: Blocking optimal arborescences. Math. Program. 161(1), 583–601 (2017)
3. Chekuri, C., Kamath, S., Kannan, S., Viswanath, P.: Delay-constrained unicast and the triangle-cast problem. In: IEEE International Symposium on Information Theory (ISIT), pp. 804–808 (2015)
4. Chekuri, C., Madan, V.: Approximating multicut and the demand graph. In: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 855–874 (2017)
5. Cheung, K., Cunningham, W., Tang, L.: Optimal 3-terminal cuts and linear programming. Math. Program. 106(1), 1–23 (2006)