Which NP-hard optimization problems admit non-trivial efficient approximation algorithms?

被引:0
|
作者
Håstad, J [1 ]
机构
[1] Royal Inst Technol, Stockholm, Sweden
来源
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:235 / 235
页数:1
相关论文
共 50 条
  • [21] Decomposition Algorithms for Solving NP-hard Problems on a Quantum Annealer
    Elijah Pelofske
    Georg Hahn
    Hristo Djidjev
    [J]. Journal of Signal Processing Systems, 2021, 93 : 405 - 420
  • [22] Decomposition Algorithms for Solving NP-hard Problems on a Quantum Annealer
    Pelofske, Elijah
    Hahn, Georg
    Djidjev, Hristo
    [J]. JOURNAL OF SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY, 2021, 93 (04): : 405 - 420
  • [23] ON THE PERFORMANCE GUARANTEE OF NEURAL NETWORKS FOR NP-HARD OPTIMIZATION PROBLEMS
    ZISSIMOPOULOS, V
    [J]. INFORMATION PROCESSING LETTERS, 1995, 54 (06) : 317 - 322
  • [24] Comparing Problem Solving Strategies for NP-hard Optimization Problems
    Hidalgo-Herrero, Mercedes
    Rabanal, Pablo
    Rodriguez, Ismael
    Rubio, Fernando
    [J]. FUNDAMENTA INFORMATICAE, 2013, 124 (1-2) : 1 - 25
  • [25] Dilemma First Search for Effortless Optimization of NP-hard Problems
    Weissenberg, Julien
    Riemenschneider, Hayko
    Dragon, Ralf
    Van Gool, Luc
    [J]. 2016 23RD INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION (ICPR), 2016, : 4154 - 4159
  • [26] Simulation of an analogue circuit solving NP-hard optimization problems
    Babicz, Dora
    Tihanyi, Attila
    Koller, Miklos
    Rekeczky, Csaba
    Horvath, Andras
    [J]. 2019 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), 2019,
  • [27] Polynomial time approximation schemes for dense instances of NP-hard problems
    Arora, S
    Karger, D
    Karpinski, M
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1999, 58 (01) : 193 - 210
  • [28] Differential approximation of NP-hard problems with equal size feasible solutions
    Monnot, J
    [J]. RAIRO-OPERATIONS RESEARCH, 2002, 36 (04) : 279 - 297
  • [29] Parallel Island Model Genetic Algorithms applied in NP-Hard problems
    da Silveira, Lucas A.
    Soncco-Alvarez, Jose L.
    de Lima, Thaynara A.
    Ayala-Rincon, Mauricio
    [J]. 2019 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2019, : 3262 - 3269
  • [30] Tractable Approximation Algorithms for the NP-Hard Problem of Growing Linear Consensus Networks
    Siami, Milad
    Motee, Nader
    [J]. 2016 AMERICAN CONTROL CONFERENCE (ACC), 2016, : 6429 - 6434