The Densest SWAMP Problem: Subhypergraphs with Arbitrary Monotonic Partial Edge Rewards

Bengali et al. "The Densest SWAMP Problem: Subhypergraphs with Arbitrary Monotonic Partial Edge Rewards." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2025. doi:10.1007/978-3-032-06066-2_5

[Bengali et al. "The Densest SWAMP Problem: Subhypergraphs with Arbitrary Monotonic Partial Edge Rewards." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2025.](https://mlanthology.org/ecmlpkdd/2025/bengali2025ecmlpkdd-densest/) doi:10.1007/978-3-032-06066-2_5

@inproceedings{bengali2025ecmlpkdd-densest,
  title     = {{The Densest SWAMP Problem: Subhypergraphs with Arbitrary Monotonic Partial Edge Rewards}},
  author    = {Bengali, Vedangi and Tatti, Nikolaj and Kumpulainen, Iiro and Adriaens, Florian and Veldt, Nate},
  booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
  year      = {2025},
  pages     = {75-91},
  doi       = {10.1007/978-3-032-06066-2_5},
  url       = {https://mlanthology.org/ecmlpkdd/2025/bengali2025ecmlpkdd-densest/}
}