Approximation techniques for hypergraph partitioning problems
The paper discusses techniques for approximating a hypergraph by a weighted graph. This has potential applications in node partitioning algorithms. The approximations are compared with other known approximations and according to the author yield promising results.
scientific article; zbMATH DE number 761078
scientific article