Instruct: Given a scientific paper title, retrieve paper titles that are cited by the given paper
Query: Approximation algorithms for bipartite matching with metric and geometric costs
an n5 / 2 algorithm for maximum matchings in bipartite graphs .
Star p-hub center problem and star p-hub median problem with bounded path lengths
The traveling salesman problem: An overview of exact and approximate algorithms
A polynomial time approximation scheme for minimum routing cost spanning trees
A Fast , Adaptive Variant of the Goemans-Williamson Scheme for the Prize-Collecting Steiner Tree Problem
Fast Algorithms for Geometric Traveling Salesman Problems
The stable marriage problem
An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations
A Partition-Based Match Making Algorithm for Dynamic Ridesharing
The Design of Approximation Algorithms
an approximation algorithm for the generalized assignment problem .
The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
Packing Steiner Trees
the stable marriage problem with restricted pairs .
An Approximate Dual Projective Algorithm for Solving Assignment Problems
Approximation algorithms for data placement in arbitrary networks
Combinatorial optimization : algorithms and complexity
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs
Gene Selection for Cancer Classification using Support Vector Machines
Measurement and Analysis of Operating System Fault-tolerance
A quick method for finding shortest pairs of disjoint paths
Surface integrated waveguide fed Antipodal Fermi-Linear Tapered Slot Antenna at 28 GHz
the impact of business intelligence on organization ' s effectiveness : an empirical study .