Piotr Berman, Marek Karpinski. Approximability of Hypergraph Minimum Bisection . Electronic Colloquium on Computational Complexity (ECCC), (056), 2003. [doi]
@article{ECCC-TR03-056, title = {Approximability of Hypergraph Minimum Bisection }, author = {Piotr Berman and Marek Karpinski}, year = {2003}, url = {http://eccc.hpi-web.de/eccc-reports/2003/TR03-056/index.html}, researchr = {https://researchr.org/publication/ECCC-TR03-056}, cites = {0}, citedby = {0}, journal = {Electronic Colloquium on Computational Complexity (ECCC)}, number = {056}, }