Approximation techniques for hypergraph partitioning problems (Q1891922): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q199001 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Vladimir D. Tonchev / rank | |||
Normal rank | |||
Revision as of 17:42, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation techniques for hypergraph partitioning problems |
scientific article |
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
