A direct \(k\)-way hypergraph partitioning algorithm for optimizing the Steiner tree metric (Q6545381)
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: A direct k-way hypergraph partitioning algorithm for optimizing the Steiner tree metric |
scientific article; zbMATH DE number 7854933
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A direct \(k\)-way hypergraph partitioning algorithm for optimizing the Steiner tree metric |
scientific article; zbMATH DE number 7854933 |
Statements
A direct \(k\)-way hypergraph partitioning algorithm for optimizing the Steiner tree metric (English)
0 references
29 May 2024
0 references
0.7717084884643555
0 references
0.7690139412879944
0 references
0.7523177862167358
0 references
0.7425395846366882
0 references
