Clustering in hypergraphs to minimize average edge service time (Q4987462)
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 7342483
| 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 7342483 |
Statements
Clustering in Hypergraphs to Minimize Average Edge Service Time (English)
0 references
3 May 2021
0 references
clustering
0 references
average cover time
0 references
hypergraphs
0 references
set cover
0 references
0.9997443556785583
0 references
0.7141782641410828
0 references
0.7091227769851685
0 references
0.7066369652748108
0 references
