Instruct: Given the title of a scientific paper, retrieve paper titles that are cited by the given paper
Query: Approximation Algorithms for Partial Covering Problems
Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs
Computing Partitions with Applications to the Knapsack Problem
Tight approximation algorithms for maximum general assignment problems
Partial Constraint Satisfaction
A PTAS for the multiple knapsack problem
The traveling salesman problem: An overview of exact and approximate algorithms
A convex relaxation approach for computing minimal partitions
Algorithms For Vertex Partitioning Problems On Partial k-Trees
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
Approximation Algorithms for Rectangle Packing Problems (PhD Thesis)
Exact algorithms for NP-hard problems: A survey
Divide-and-conquer approximation algorithms via spreading metrics
The Design of Approximation Algorithms
Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
Approximation algorithms for directed Steiner problems
the set covering problem solved by the black hole algorithm .
Hierarchical and Dynamic k-Path Covers
Approximation Algorithms
Approximation Algorithms Via Randomized Rounding: A Survey
an approximation algorithm for the generalized assignment problem .
Approximating maximum independent set in bounded degree graphs
A survey on image segmentation
Microfluidic liquid metal based mechanically reconfigurable antenna using reversible gecko adhesive based bonding
Learning Python Code Suggestion with a Sparse Pointer Network
Polarizers on sections of square waveguides with inner corner ridges