Funder
National Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference15 articles.
1. Aissi, H., Mahjoub, A., McCormick, T., Queyranne, M.: Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs. Math. Program. 154(1–2), 3–28 (2015)
2. Aissi, H., Mahjoub, A., Ravi, R.: Randomized contractions for multiobjective minimum cuts. In: Proceedings of the 25th Annual European Symposium on Algorithms, ESA, pp. 6:1–6:13 (2017)
3. Armon, A., Zwick, U.: Multicriteria global minimum cuts. Algorithmica 46(1), 15–26 (2006)
4. Chandrasekaran, K., Xu, C., Yu, X.: Hypergraph $$k$$-cut in randomized polynomial time. Math. Program. 186, 85–113 (2021)
5. Chekuri, C., Xu, C.: Minimum cuts and sparsification in hypergraphs. SIAM J. Comput. 47(6), 2118–2156 (2018)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献