Sarah Jean Hood, Stuart Bermon, et al.
IEEE Trans Semicond Manuf
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
Francisco Barahona, Stuart Bermon, et al.
Naval Research Logistics
Mourad Baïou, Francisco Barahona
Discrete Applied Mathematics
David Melville, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2010