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 条
  • [1] Typical performance of approximation algorithms for NP-hard problems
    Takabe, Satoshi
    Hukushima, Koji
    [J]. JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2016,
  • [2] Efficient Approximation Algorithms for Some NP-hard Problems of Partitioning a Set and a Sequence
    Kel'manov, Alexander
    [J]. 2017 INTERNATIONAL MULTI-CONFERENCE ON ENGINEERING, COMPUTER AND INFORMATION SCIENCES (SIBIRCON), 2017, : 87 - 90
  • [3] The inapproximability of non NP-hard optimization problems
    Cai, LM
    Juedes, D
    Kanj, I
    [J]. ALGORITHMS AND COMPUTATIONS, 1998, 1533 : 437 - 446
  • [4] Approximation schemes for NP-hard geometric optimization problems: a survey
    Sanjeev Arora
    [J]. Mathematical Programming, 2003, 97 : 43 - 69
  • [5] Approximation schemes for NP-hard geometric optimization problems: a survey
    Arora, S
    [J]. MATHEMATICAL PROGRAMMING, 2003, 97 (1-2) : 43 - 69
  • [6] Which bases admit non-trivial shrinkage of formulae?
    H. Chockler
    U. Zwick
    [J]. computational complexity, 2001, 10 : 28 - 40
  • [7] Which bases admit non-trivial shrinkage of formulae?
    Chockler, H
    Zwick, U
    [J]. COMPUTATIONAL COMPLEXITY, 2001, 10 (01) : 28 - 40
  • [8] An Efficient Structured Perceptron for NP-Hard Combinatorial Optimization Problems
    Vejar, Bastian
    Aglin, Gael
    Mahmutogullari, Ali Irfan
    Nijssen, Siegfried
    Schaus, Pierre
    Guns, Tias
    [J]. INTEGRATION OF CONSTRAINT PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND OPERATIONS RESEARCH, PT II, CPAIOR 2024, 2024, 14743 : 253 - 262
  • [9] Approximation of some NP-hard optimization problems by finite machines, in probability
    Hong, DW
    Birget, JC
    [J]. THEORETICAL COMPUTER SCIENCE, 2001, 259 (1-2) : 323 - 339
  • [10] NP-hard approximation problems in overlapping clustering
    Barthélemy J.-P.
    Brucker F.
    [J]. Journal of Classification, 2001, 18 (2) : 159 - 183
12345