Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
MohammadHossein BateniMohammadTaghi HajiaghayiDániel MarxPublished in: CoRR (2009)
Keyphrases
- bounded treewidth
- planar graphs
- approximation schemes
- np complete
- approximation algorithms
- decision problems
- undirected graph
- conjunctive queries
- boolean functions
- relational learning
- np hard
- bin packing
- special case
- machine learning
- weighted graph
- approximate inference
- relational data
- numerical methods
- computational complexity