Author:
Baïou Mourad,Barahona Francisco
Publisher
Springer International Publishing
Reference27 articles.
1. Baiou, M., Barahona, F.: On some algorithmic aspects of hypergraphic matroids. arXiv 2111.05699 (2021)
2. Barahona, F.: Packing spanning trees. Math. Oper. Res. 20(1), 104–115 (1995)
3. Barahona, F.: On the k-cut problem. Oper. Res. Lett. 26(3), 99–105 (2000)
4. Chandrasekaran, K., Chekuri, C.: Hypergraph $$ k $$-cut for fixed $$ k $$ in deterministic polynomial time. In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pp. 810–821. IEEE (2020)
5. Chandrasekaran, K., Xu, C., Yu, X.: Hypergraph k-cut in randomized polynomial time. Math. Program. 186(1), 85–113 (2021)