Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth.
Tobias FriedrichDavis IssacNikhil KumarNadym MallekZiena ZeifPublished in: CoRR (2022)
Keyphrases
- bounded treewidth
- max flow
- np complete
- monadic datalog
- conjunctive queries
- energy minimization
- decision problems
- boolean functions
- relational learning
- convex programming
- graph cuts
- min cut
- bounded degree
- np hard
- convex relaxation
- phase unwrapping
- spanning tree
- quadratic programming
- exact solution
- machine learning
- convex optimization
- integrity constraints
- computational complexity