Login / Signup
Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs.
Parinya Chalermsook
Syamantak Das
Bundit Laekhanukit
Daniel Vaz
Published in:
SODA (2017)
Keyphrases
</>
bounded treewidth
steiner tree
np complete
decision problems
conjunctive queries
minimum spanning tree
relational learning
boolean functions
inductive logic programming
graph theoretic
search space
shortest path
background knowledge
traveling salesman problem
graph theory
geodesic distance