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 条
  • [31] Approximation algorithms and hardness results for labeled connectivity problems
    Hassin, Refael
    Monnot, Jerome
    Segev, Danny
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2006, PROCEEDINGS, 2006, 4162 : 480 - 491
  • [32] Approximation algorithms and hardness results for labeled connectivity problems
    Hassin, Refael
    Monnot, Jerome
    Segev, Danny
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2007, 14 (04) : 437 - 453
  • [33] On the approximation hardness of dense TSP and other path problems
    de la Vega, WF
    Karpinski, M
    INFORMATION PROCESSING LETTERS, 1999, 70 (02) : 53 - 55
  • [34] Approximation and hardness results for label cut and related problems
    Zhang, Peng
    Cai, Jin-Yi
    Tang, Lin-Qing
    Zhao, Wen-Bo
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2011, 21 (02) : 192 - 208
  • [35] Approximation algorithms and hardness results for labeled connectivity problems
    Refael Hassin
    Jérôme Monnot
    Danny Segev
    Journal of Combinatorial Optimization, 2007, 14 : 437 - 453
  • [36] Knapsack problems with sigmoid utilities: Approximation algorithms via hybrid optimization
    Srivastava, Vaibhav
    Bullo, Francesco
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 236 (02) : 488 - 498
  • [37] Approximation Algorithms and Hardness Results for Cycle Packing Problems
    Krivelevich, Michael
    Nutov, Zeev
    Salavatipour, Mohammad R.
    Verstraete, Jacques
    Yuster, Raphael
    ACM TRANSACTIONS ON ALGORITHMS, 2007, 3 (04)
  • [38] Hardness and approximation of submodular minimum linear ordering problems
    Farhadi, Majid
    Gupta, Swati
    Sun, Shengding
    Tetali, Prasad
    Wigal, Michael C.
    MATHEMATICAL PROGRAMMING, 2024, 208 (1-2) : 277 - 318
  • [39] Approximation and Hardness Results for Label Cut and Related Problems
    Zhang, Peng
    Cai, Jin-Yi
    Tang, Linqing
    Zhao, Wenbo
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, 2009, 5532 : 460 - +
  • [40] Approximation hardness of domination problems on generalized convex graphs
    Wang, Po Yuan
    Kitamura, Naoki
    Izumi, Taisuke
    Masuzawa, Toshimitsu
    THEORETICAL COMPUTER SCIENCE, 2025, 1028
12345