"Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications."

Pál András Papp, Georg Anegg, Albert-Jan Nicholas Yzelman (2023)

> Home

Details and statistics

DOI: 10.1145/3558481.3591087

access: closed

type: Conference or Workshop Paper

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/spaa/PappAY23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/spaa/PappAY23
Pál András Papp, Georg Anegg, Albert-Jan Nicholas Yzelman:
Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications. SPAA 2023: 415-425

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.