Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Clustering in Hypergraphs to Minimize Average Edge Service Time - MaRDI portal

Clustering in Hypergraphs to Minimize Average Edge Service Time

From MaRDI portal

Publication:4987462

Jump to:navigation, search

DOI10.1145/3386121zbMath1484.68171OpenAlexW3033291176WikidataQ114976815 ScholiaQ114976815MaRDI QIDQ4987462

Avinatan Hassidim, Ori Rottenstreich, Haim Kaplan

Publication date: 3 May 2021

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/7877/

zbMATH Keywords

clustering hypergraphs set cover average cover time

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

This page was built for publication: Clustering in Hypergraphs to Minimize Average Edge Service Time

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4987462&oldid=19430566"