A new approximation technique for hypergraph partitioning problem

MaRDI QIDQ4035643zbMATH OpenFDO

Authors Scott W. Hadley

Publication date 18 May 1993

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Programming involving graphs or networks (90C35)

Cited in

(1)

• A cell formation algorithm: Hypergraph approximation -- cut tree

This page was built for publication: A new approximation technique for hypergraph partitioning problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035643)