Instruct: Given the title of a scientific paper, retrieve paper titles that are cited by the given paper.
Query: A constant-factor approximation algorithm for the k-median problem
Approximation schemes for Euclidean k-medians and related problems
A 1.488 approximation algorithm for the uncapacitated facility location problem
Approximation algorithms for facility location problems (extended abstract)
Improved and Simplified Inapproximability for k-means
A simple linear time (1 + /spl epsiv/)-approximation algorithm for k-means clustering in any dimensions
Star p-hub center problem and star p-hub median problem with bounded path lengths
Divide-and-conquer approximation algorithms via spreading metrics
Approximate Algorithms for the 0/1 Knapsack Problem
Approximation Algorithms for K-Modes Clustering
A General Greedy Approximation Algorithm with Applications
Approximation Algorithms for some Routing Problems
Approximation algorithms for directed Steiner problems
On-Line Algorithms and the k-Server Conjecture
Approximation Algorithms for the Max-Min Allocation problem
A faster approximation algorithm for the Steiner tree problem in graphs
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
An O(log 2 k)-competitive Algorithm for Metric Bipartite Matching
a k - means - like algorithm for k - medoids clustering and its performance .
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
Bin Packing Problem: Two Approximation Algorithms
A Method for Identification of Basmati Rice grain of India and Its Quality Using Pattern Classification
Top-down facilitation of visual recognition
Radio-Aware Service-Level Scheduling to Minimize Downlink Traffic Delay Through Mobile Edge Computing
Greedy strikes back: improved facility location algorithms
Comparing business competition positions based on Web co-link data: The global market vs. the Chinese market