David Melville, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2010
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
Marcos Goycoolea, Alan T. Murray, et al.
Operations Research
Mourad Baiou, Francisco Barahona
Discrete Optimization
Rui S. Shibasaki, Mourad Baiou, et al.
ITOR