Francisco Barahona, Ranga Anbil
Mathematical Programming, Series B
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
Rui S. Shibasaki, Mourad Baïou, et al.
Annals of Operations Research
Mourad Baiou, Francisco Barahona
Networks
Marcos Goycoolea, Alan T. Murray, et al.
Operations Research