A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time.
Vincent Cohen-AddadTobias MömkeVictor VerdugoPublished in: CoRR (2021)
Keyphrases
- bounded treewidth
- fixed parameter tractable
- integrality gap
- np complete
- linear programming relaxation
- highly parallelizable
- approximation algorithms
- np hard
- conjunctive queries
- decision problems
- relational learning
- lower bound
- vertex set
- boolean functions
- global constraints
- phase transition
- semi supervised
- domain knowledge
- learning algorithm