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 条
  • [41] Approximation and hardness results for label cut and related problems
    Peng Zhang
    Jin-Yi Cai
    Lin-Qing Tang
    Wen-Bo Zhao
    Journal of Combinatorial Optimization, 2011, 21 : 192 - 208
  • [42] Hardness of approximation for orthogonal rectangle packing and covering problems
    Chlebik, Miroslav
    Chlebikova, Janka
    JOURNAL OF DISCRETE ALGORITHMS, 2009, 7 (03) : 291 - 305
  • [43] Knapsack problems
    Xue, J
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2005, 56 (11) : 1346 - 1347
  • [44] AN APPROXIMATION ALGORITHM FOR SOLVING UNCONSTRAINED 2-DIMENSIONAL KNAPSACK-PROBLEMS
    FAYARD, D
    ZISSIMOPOULOS, V
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 84 (03) : 618 - 632
  • [45] A STABILITY CONCEPT FOR ZERO-ONE KNAPSACK-PROBLEMS AND APPROXIMATION ALGORITHMS
    OGUZ, O
    MAGAZINE, MJ
    INFOR, 1995, 33 (02) : 123 - 132
  • [46] Hardness of Approximation for H-free Edge Modification Problems
    Bliznets, Ivan
    Cygan, Marek
    Komosa, Pawel
    Pilipczuk, Michal
    ACM TRANSACTIONS ON COMPUTATION THEORY, 2018, 10 (02)
  • [47] Approximation hardness of dominating set problems in bounded degree graphs
    Chlebik, M.
    Chlebikova, J.
    INFORMATION AND COMPUTATION, 2008, 206 (11) : 1264 - 1275
  • [48] Hardness Results and Approximation Schemes for Discrete Packing and Domination Problems
    Madireddy, Raghunath Reddy
    Mudgal, Apurva
    Pandit, Supantha
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS (COCOA 2018), 2018, 11346 : 421 - 435
  • [49] Degree-Constrained Subgraph Problems: Hardness and Approximation Results
    Amini, Omid
    Peleg, David
    Perennes, Stephane
    Sau, Ignasi
    Saurabh, Saket
    APPROXIMATION AND ONLINE ALGORITHMS, 2009, 5426 : 29 - +
  • [50] Hardness of approximation for vertex-connectivity network design problems
    Kortsarz, G
    Krauthgamer, R
    Lee, JR
    SIAM JOURNAL ON COMPUTING, 2004, 33 (03) : 704 - 720
12345