Instruct: Given a scientific paper title, retrieve paper titles that are cited by the given paper.
Query: Highly scalable algorithms for rectilinear and octilinear Steiner trees
A new heuristic for rectilinear Steiner trees
A proof of the Gilbert-Pollak conjecture on the Steiner ratio
The traveling-salesman problem and minimum spanning trees: Part II
approximations for a bottleneck steiner tree problem .
A Distributed Algorithm for Minimum-Weight Spanning Trees
Dynamic Trees as Search Trees via Euler Tours, Applied to the Network Simplex Algorithm
A minimum spanning tree algorithm with inverse-Ackermann type complexity
The Constrained Minimum Spanning Tree Problem (Extended Abstract)
An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
Complexities of some interesting problems on spanning trees
A Note on Preconditioning by Low-Stretch Spanning Trees
Learning Combinatorial Optimization Algorithms over Graphs
Fast Algorithms for Geometric Traveling Salesman Problems
A subset spanner for Planar graphs,: with application to subset TSP
A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs
A tutorial on branch and cut algorithms for the maximum stable set problem
Approximating the Minimum Spanning Tree Weight in Sublinear Time
Approximating the Held-Karp Bound for Metric TSP in Nearly-Linear Time
Algorithms For Vertex Partitioning Problems On Partial k-Trees
The traveling salesman problem for cubic graphs
A robust hybrid multi-criteria decision making methodology for contractor evaluation and selection in third-party reverse logistics
Effect of expertise on 3D force application during the starting block phase and subsequent steps in sprint running.
XBiT: An XML-Based Bitemporal Data Model
Methods for measuring semantic similarity of texts
the rectilinear steiner tree problem in np complete .