Author:
Nägele Martin,Zenklusen Rico
Funder
Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung
European Research Council
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference33 articles.
1. Artmann, S., Weismantel, R., Zenklusen, R.:. A strongly polynomial algorithm for bimodular integer linear programming. In: Proceedings of the 49th Annual ACM Symposium on Theory of Computing (STOC), pp. 1206–1219 (2017)
2. Barahona, F., Conforti, M.: A construction for binary matroids. Discrete Math. 66(3), 213–218 (1987)
3. Benczúr, A.A.: A representation of cuts within 6/5 times the edge connectivity with applications. In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS), pp. 92–102 (1995)
4. Benczúr, A.A., Karger, D.R.: Augmenting undirected edge connectivity in $${\cal{O}}(n^2)$$ time. In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 500–509 (1998)
5. Bertsimas, D., Teo, C.: The parsimonious property of cut covering problems and its applications. Oper. Res. Lett. 21(3), 123–132 (1997)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献