Hypergraph $k$-cut for fixed $k$ in deterministic polynomial time.

Karthekeyan Chandrasekaran Chandra Chekuri

Published in: FOCS (2020)

Keyphrases

higher order
vertex set
computational complexity
special case
np hard
black box
planar graphs
pairwise
fixed number
turing machine
fixed parameter tractable
approximation algorithms
np hardness
hypergraph model
data sets
approximation ratio