A Primal-Dual Algorithm for Multicommodity Flows and Multicuts in Treewidth-2 Graphs.
Tobias FriedrichDavis IssacNikhil KumarNadym MallekZiena ZeifPublished in: APPROX/RANDOM (2022)
Keyphrases
- temporal reasoning
- bounded treewidth
- graph matching
- np complete
- search space
- upper bound
- space complexity
- constraint graph
- network design
- graph structure
- spanning tree
- network flow problem
- network design problem
- network flow
- graph theoretic
- graph representation
- minimum cost
- graph mining
- structured data
- dantzig wolfe decomposition