Near-optimal nonapproximability results for some NPO PB-complete problems

被引：4
|
作者：
Jonsson, P [1 ]
机构：
[1] Linkoping Univ, Dept Comp & Informat Sci, S-58183 Linkoping, Sweden
来源：
INFORMATION PROCESSING LETTERS | 1998年 / 68卷 / 05期
关键词：
approximation; computational complexity; combinatorial problems;
D O I：
10.1016/S0020-0190(98)00170-7
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We show that a number of NPO PB-complete problems, including MIN ONES and MAX ONES, are hard to approximate within n(1-epsilon) for arbitrary epsilon > 0. (C) 1998 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：249 / 253
页数：5
相关论文
共 50 条
  • [41] Adaptive near-optimal controllers for non-linear decentralised feedback stabilisation problems
    Wang, Ding
    He, Haibo
    Zhao, Bo
    Liu, Derong
    IET CONTROL THEORY AND APPLICATIONS, 2017, 11 (06): : 799 - 806
  • [42] A Near-Optimal Hierarchical Estimate Based Adaptive Finite Element Method for Obstacle Problems
    Zou, Qingsong
    DOMAIN DECOMPOSITION METHODS IN SCIENCE AND ENGINEERING XIX, 2011, 78 : 317 - 324
  • [43] NEAR-OPTIMAL CONTROL LAW FOR PURSUIT-EVASION PROBLEMS BETWEEN 2 SPACECRAFT
    ANDERSON, GM
    BOHN, GD
    AIAA JOURNAL, 1977, 15 (08) : 1203 - 1205
  • [44] Near-optimal solutions of large-scale single-machine scheduling problems
    Avella, P
    Boccia, M
    D'Auria, B
    INFORMS JOURNAL ON COMPUTING, 2005, 17 (02) : 183 - 191
  • [45] Multi-Message Private Information Retrieval: Capacity Results and Near-Optimal Schemes
    Banawan, Karim
    Ulukus, Sennur
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (10) : 6842 - 6862
  • [46] Checking for optimal solutions in some NP-complete problems
    Bauer, M
    Orland, H
    PHYSICAL REVIEW LETTERS, 2005, 95 (10)
  • [47] Near-optimal controls of random-switching LQ problems with indefinite control weight costs
    Liu, YJ
    Yin, G
    Zhou, XY
    AUTOMATICA, 2005, 41 (06) : 1063 - 1070
  • [48] Provably near-optimal solutions for very large single-row facility layout problems
    Anjos, Miguel F.
    Yen, Ginger
    OPTIMIZATION METHODS & SOFTWARE, 2009, 24 (4-5): : 805 - 817
  • [49] DETERMINING ALL OPTIMAL AND NEAR-OPTIMAL SOLUTIONS WHEN SOLVING SHORTEST-PATH PROBLEMS BY DYNAMIC-PROGRAMMING
    BYERS, TH
    WATERMAN, MS
    OPERATIONS RESEARCH, 1984, 32 (06) : 1381 - 1384
  • [50] SOME RESULTS ON OPTIMAL-CONTROL FOR UNILATERAL PROBLEMS
    PUEL, JP
    LECTURE NOTES IN CONTROL AND INFORMATION SCIENCES, 1989, 114 : 225 - 235
12345