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

Ori Rottenstreich, Haim Kaplan, Avinatan Hassidim (2017)

> Home

Details and statistics

DOI: 10.4230/LIPICS.ESA.2017.64

access: open

type: Conference or Workshop Paper

metadata version: 2018-08-23

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/esa/RottenstreichKH17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/esa/RottenstreichKH17
Ori Rottenstreich, Haim Kaplan, Avinatan Hassidim:
Clustering in Hypergraphs to Minimize Average Edge Service Time. ESA 2017: 64:1-64:14

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.