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

被引：0
|
作者：
Håstad, J [1 ]
机构：
[1] Royal Inst Technol, Stockholm, Sweden
来源：
AUTOMATA LANGUAGES AND PROGRAMMING | 2000年 / 1853卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：235 / 235
页数：1
相关论文
共 50 条
  • [41] Genetic annealing with efficient strategies to improve the performance for the NP-hard and routing problems
    Eswarawaka, Rajesh
    Mahammad, S. K. Noor
    Reddy, B. Eswara
    [J]. JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE, 2015, 27 (06) : 779 - 788
  • [42] LINEAR TIME ALGORITHMS FOR NP-HARD PROBLEMS RESTRICTED TO PARTIAL K-TREES
    ARNBORG, S
    PROSKUROWSKI, A
    [J]. DISCRETE APPLIED MATHEMATICS, 1989, 23 (01) : 11 - 24
  • [43] NC algorithms for partitioning planar graphs into induced forests and approximating NP-hard problems
    Chen, ZZ
    He, X
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1995, 1017 : 275 - 289
  • [44] Adaptive multi-strategy particle swarm optimization for solving NP-hard optimization problems
    Abadlia, Houda
    Belhassen, Imhamed R.
    Smairi, Nadia
    [J]. INTERNATIONAL JOURNAL OF KNOWLEDGE-BASED AND INTELLIGENT ENGINEERING SYSTEMS, 2024, 28 (01) : 195 - 209
  • [45] Linear-complex LAS detectors can achieve bit error rate of the NP-hard optimum detector in non-trivial large random spreading CDMA
    Yi Sun
    [J]. 2006 6TH INTERNATIONAL CONFERENCE ON ITS TELECOMMUNICATIONS PROCEEDINGS, 2006, : 701 - 705
  • [46] NP-Hard Graph Problems' Algorithms Testing Guidelines: Artificial Intelligence Principles and Testing as a Service
    Kumlander, Deniss
    [J]. INNOVATIVE TECHNIQUES IN INSTRUCTION TECHNOLOGY, E-LEARNING, E-ASSESSMENT AND EDUCATION, 2008, : 112 - 116
  • [47] The inapproximability of non-NP-hard optimization problems
    Cai, LM
    Juedes, D
    Kanj, I
    [J]. THEORETICAL COMPUTER SCIENCE, 2002, 289 (01) : 553 - 571
  • [48] Finding approximate solutions of NP-hard optimization and TSP problems using elephant search algorithm
    Deb, Suash
    Fong, Simon
    Tian, Zhonghuan
    Wong, Raymond K.
    Mohammed, Sabah
    Fiaidhi, Jinan
    [J]. JOURNAL OF SUPERCOMPUTING, 2016, 72 (10): : 3960 - 3992
  • [49] Finding approximate solutions of NP-hard optimization and TSP problems using elephant search algorithm
    Suash Deb
    Simon Fong
    Zhonghuan Tian
    Raymond K. Wong
    Sabah Mohammed
    Jinan Fiaidhi
    [J]. The Journal of Supercomputing, 2016, 72 : 3960 - 3992
  • [50] Inverse problems with non-trivial priors: efficient solution through sequential Gibbs sampling
    Hansen, Thomas Mejer
    Cordua, Knud Skou
    Mosegaard, Klaus
    [J]. COMPUTATIONAL GEOSCIENCES, 2012, 16 (03) : 593 - 611
12345