Hardness of Approximation for Knapsack Problems

被引：0
|
作者：
Harry Buhrman
Bruno Loff
Leen Torenvliet
机构：
[1] CWI,ILLC
[2] University of Amsterdam,undefined
来源：
Theory of Computing Systems | 2015年 / 56卷
关键词：
Computational complexity; Knapsack problem; Subset-sum; Exponential-time hypothesis; PRAM without bit operations; Algebraic-circuit lower-bounds; Hardness of approximation;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We show various hardness results for knapsack and related problems; in particular we will show that unless the Exponential-Time Hypothesis is false, subset-sum cannot be approximated any better than with an FPTAS. We also provide new unconditional lower bounds for approximating knapsack in Ketan Mulmuley’s parallel PRAM model. Furthermore, we give a simple new algorithm for approximating knapsack and subset-sum, that can be adapted to work for small space, or in small parallel time.
引用
收藏
页码：372 / 393
页数：21
相关论文
共 50 条
  • [21] Hardness results for neural network approximation problems
    Bartlett, PL
    Ben-David, S
    THEORETICAL COMPUTER SCIENCE, 2002, 284 (01) : 53 - 66
  • [22] Approximation Hardness for A Class of Sparse Optimization Problems
    Chen, Yichen
    Ye, Yinyu
    Wang, Mengdi
    JOURNAL OF MACHINE LEARNING RESEARCH, 2019, 20
  • [23] Approximation hardness of edge dominating set problems
    Chlebík, M
    Chlebíková, J
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2006, 11 (03) : 279 - 290
  • [24] Approximation hardness of edge dominating set problems
    Miroslav Chlebík
    Janka Chlebíková
    Journal of Combinatorial Optimization, 2006, 11 : 279 - 290
  • [25] Hardness results for neural network approximation problems
    Bartlett, P
    Ben-David, S
    COMPUTATIONAL LEARNING THEORY, 1999, 1572 : 50 - 62
  • [26] Approximation hardness for a class of sparse optimization problems
    Chen, Yichen
    Ye, Yinyu
    Wang, Mengdi
    Journal of Machine Learning Research, 2019, 20
  • [27] PARALLEL APPROXIMATION SCHEMES FOR SUBSET SUM AND KNAPSACK-PROBLEMS
    PETERS, JG
    RUDOLPH, L
    ACTA INFORMATICA, 1987, 24 (04) : 417 - 432
  • [28] Approximation schemes for r-weighted Minimization Knapsack problems
    Elbassioni, Khaled
    Karapetyan, Areg
    Trung Thanh Nguyen
    ANNALS OF OPERATIONS RESEARCH, 2019, 279 (1-2) : 367 - 386
  • [29] Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications
    Swamy, Chaitanya
    ACM TRANSACTIONS ON ALGORITHMS, 2016, 12 (04)
  • [30] Approximation Algorithms for the Generalized Multiple Knapsack Problems with k Restricted Elements
    Huang, Binchao
    Li, Jianping
    Lih, Ko-Wei
    Wang, Haiyan
    2015 7TH INTERNATIONAL CONFERENCE ON INTELLIGENT HUMAN-MACHINE SYSTEMS AND CYBERNETICS IHMSC 2015, VOL I, 2015, : 470 - 474
12345