"Clustering in Hypergraphs to Minimize Average Edge Service Time."

Ori Rottenstreich, Haim Kaplan, Avinatan Hassidim (2020)

> Home

Details and statistics

DOI: 10.1145/3386121

access: closed

type: Journal Article

metadata version: 2023-08-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/RottenstreichKH20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/RottenstreichKH20
Ori Rottenstreich, Haim Kaplan, Avinatan Hassidim:
Clustering in Hypergraphs to Minimize Average Edge Service Time. ACM Trans. Algorithms 16(3): 40:1-40:28 (2020)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.