Approximation techniques for hypergraph partitioning problems (Q1891922)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximation techniques for hypergraph partitioning problems |
scientific article; zbMATH DE number 761078
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation techniques for hypergraph partitioning problems |
scientific article; zbMATH DE number 761078 |
Statements
Approximation techniques for hypergraph partitioning problems (English)
0 references
26 October 1995
0 references
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.
0 references
hypergraph partitioning
0 references
hypergraph
0 references
weighted graph
0 references
node partitioning algorithms
0 references
approximations
0 references
