"The Densest SWAMP problem: subhypergraphs with arbitrary monotonic partial ..."

Vedangi Bengali et al. (2025)

> Home

Details and statistics

DOI: 10.48550/ARXIV.2506.12998

access: open

type: Informal or Other Publication

metadata version: 2025-07-10

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2506-12998
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2506-12998
Vedangi Bengali, Nikolaj Tatti, Iiro Kumpulainen, Florian Adriaens, Nate Veldt:
The Densest SWAMP problem: subhypergraphs with arbitrary monotonic partial edge rewards. CoRR abs/2506.12998 (2025)

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.