Clustering in Hypergraphs to Minimize Average Edge Service Time (Q5111753)
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: Clustering in Hypergraphs to Minimize Average Edge Service Time |
scientific article; zbMATH DE number 7205042
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Clustering in Hypergraphs to Minimize Average Edge Service Time |
scientific article; zbMATH DE number 7205042 |
Statements
27 May 2020
0 references
clustering
0 references
average cover time
0 references
hypergraphs
0 references
set cover
0 references
Clustering in Hypergraphs to Minimize Average Edge Service Time (English)
0 references
0 references
0.8813903
0 references
0.85117507
0 references
0 references
0.85054183
0 references
0 references
0.8481307
0 references
