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

Karthekeyan Chandrasekaran Chandra Chekuri

Published in: CoRR (2020)

Keyphrases

vertex set
special case
computational complexity
higher order
approximation algorithms
planar graphs
pairwise
fixed parameter tractable
database
np hard
deterministic domains
integrality gap
worst case
high order
black box
np hardness
hypergraph model
deterministic automata
decomposable negation normal form