Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs.
PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS（2017）
Key words
Constraint Satisfaction Problems
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined