Mourad Baïou, Francisco Barahona
Discrete Applied Mathematics
Paper
An algorithm for packing hypertrees
Abstract
We present a combinatorial algorithm for determining a maximum packing of hypertrees in a capacitated hypergraph. This is an algorithmic proof of a theorem by Frank et al. [7]. This allows the extension of several algorithms developed for graphs to hypergraphs, for the k-cut problem.
Related
Mourad Baiou, Francisco Barahona
Algorithmica
Mourad Baïou, Francisco Barahona, et al.
Electron. Notes Discrete Math.
Mourad Baïou, Francisco Barahona
Discrete Optimization