Skip to main navigation
Skip to search
Skip to main content
University of Illinois Urbana-Champaign Home
LOGIN & Help
Home
Profiles
Research units
Research & Scholarship
Datasets
Honors
Press/Media
Activities
Search by expertise, name or affiliation
PTAS for the Multiple Knapsack problem
Chandra Chekuri
, Sanjeev Khanna
Research output
:
Contribution to conference
›
Paper
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'PTAS for the Multiple Knapsack problem'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Multiple Knapsack Problem
100%
APX-hardness
57%
Generalized Assignment Problem
57%
Knapsack Problem
28%
Knapsack
14%
2-approximation
14%
Polynomial-time Approximation Scheme
14%
Tardos
14%
Approximate Reduction
14%
Bin Packing Problem
14%
Maximum Profit
14%
Computer Science
Knapsack Problem
100%
Assignment Problem
50%
Approximation (Algorithm)
37%
Knapsack
25%
Polynomial Time
12%
Bin Packing Problem
12%
Time Approximation Scheme
12%
Maximum Profit
12%
Mathematics
Generalized Assignment Problem
100%
Polynomial Time
25%
Main Result
25%
Packing Problem
25%