Login / Signup
Efficient Flow-based Approximation Algorithms for Submodular Hypergraph Partitioning via a Generalized Cut-Matching Game.
Konstantinos Ameranis
Antares Chen
Lorenzo Orecchia
Erasmo Tani
Published in:
CoRR (2023)
Keyphrases
</>
approximation algorithms
special case
vertex cover
worst case
np hard
minimum cost
objective function
set cover
facility location problem
primal dual
min cost
constant factor
randomized algorithms
hypergraph partitioning
genetic algorithm
optimal solution
disjoint paths