The Densest SWAMP problem: subhypergraphs with arbitrary monotonic partial edge rewards

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bengali, Vedangi, Tatti, Nikolaj, Kumpulainen, Iiro, Adriaens, Florian, Veldt, Nate
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2506.12998