Cover Image

Improved Hardness and Approximations for Cardinality-Based Minimum $s$-$t$ Cuts Problems in Hypergraphs

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Adriaens, Florian, Bengali, Vedangi, Kumpulainen, Iiro, Tatti, Nikolaj, Veldt, Nate
Format: Preprint
Published: 2024
Subjects:
Computational Complexity
Data Structures and Algorithms
Online Access:
Acceder al recurso
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first

Similar Items