On the tractability and approximability of non-submodular cardinality-based $s$-$t$ cut problems in hypergraphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bengali, Vedangi, Veldt, Nate
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms Computational Complexity Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2409.16195