Back to Results
First PageMeta Content
Dynamic programming / Operations research / Complexity classes / Approximation algorithms / Polynomial-time approximation scheme / Knapsack problem / Subset sum problem / Parameterized complexity / Optimization problem / Theoretical computer science / Computational complexity theory / Applied mathematics


There is No EPTAS for Two-dimensional Knapsack Ariel Kulik∗ Hadas Shachnai† Abstract
Add to Reading List

Document Date: 2010-12-30 12:50:07

Open Document

File Size: 161,20 KB

Share Result on Facebook

City

Boston / Haifa / New York / /

Company

Springer-Verlag New York Inc. / 3SAT / PWS Publishing Co. / /

Country

Israel / United States / /

Currency

cent / /

/

IndustryTerm

fixed-parameter algorithms / real-life applications / computing / feasible solution / Approximation algorithms / approximate solution / /

Organization

Technion V / Technion / /

Person

D. S. Hochbaum / Ariel Kulik∗ Hadas Shachnai / /

Position

editor / /

Product

Pentax K-x Digital Camera / /

ProvinceOrState

New York / /

PublishedMedium

Theoretical Computer Science / /

Technology

Approximation algorithms / fixed-parameter algorithms / SNP / following algorithm / augmenting algorithm / /

SocialTag