"The Densest SWAMP Problem: Subhypergraphs with Arbitrary Monotonic Partial ..."

Vedangi Bengali et al. (2025)

> Home

Details and statistics

DOI: 10.1007/978-3-032-06066-2_5

access: closed

type: Conference or Workshop Paper

metadata version: 2025-10-11

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/pkdd/BengaliTKAV25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pkdd/BengaliTKAV25
Vedangi Bengali, Nikolaj Tatti, Iiro Kumpulainen, Florian Adriaens, Nate Veldt:
The Densest SWAMP Problem: Subhypergraphs with Arbitrary Monotonic Partial Edge Rewards. ECML/PKDD (3) 2025: 75-91

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.