Reducing the minimum T-cut problem to polynomial size linear programming.

Rüdiger Stephan

Published in: CTW (2011)

Keyphrases

polynomial size
linear programming
exponential size
boolean functions
dnf formulas
dynamic programming
np hard
optimal solution
objective function
knowledge compilation
theoretical analysis
integer programming
bounded treewidth
special case
uniform distribution