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

Documenti analoghi

• The Densest SWAMP problem: subhypergraphs with arbitrary monotonic partial edge rewards
  di: Bengali, Vedangi, et al.
  Pubblicazione: (2025)
• On the tractability and approximability of non-submodular cardinality-based $s$-$t$ cut problems in hypergraphs
  di: Bengali, Vedangi, et al.
  Pubblicazione: (2024)
• Max-Min Diversification with Asymmetric Distances
  di: Kumpulainen, Iiro, et al.
  Pubblicazione: (2025)
• Finding coherent node groups in directed graphs
  di: Kumpulainen, Iiro, et al.
  Pubblicazione: (2023)
• Dense Subgraph Discovery Meets Strong Triadic Closure
  di: Arachchi, Chamalee Wickrama, et al.
  Pubblicazione: (2025)