Packing Hypertrees and the k-cut Problem in Hypergraphs

Mourad Baïou, Francisco Barahona. Packing Hypertrees and the k-cut Problem in Hypergraphs. In Dimitris E. Simos, Varvara Rasskazova, Francesco Archetti, Ilias S. Kotsireas, Panos M. Pardalos, editors, Learning and Intelligent Optimization - 16th International Conference, LION 2022, Milos Island, Greece, June 5-10, 2022, Revised Selected Papers. Volume 13621 of Lecture Notes in Computer Science, pages 521-534, Springer, 2022. [doi]

Abstract

Abstract is missing.