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 条
  • [21] Deriving multiple near-optimal solutions to deterministic reservoir operation problems
    Liu, Pan
    Cai, Ximing
    Guo, Shenglian
    WATER RESOURCES RESEARCH, 2011, 47
  • [22] Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems
    Hajiaghayi, MohammadTaghi
    Liaghat, Vahid
    Panigrahi, Debmalya
    AUTOMATA, LANGUAGES, AND PROGRAMMING (ICALP 2014), PT I, 2014, 8572 : 576 - 587
  • [23] Near-Optimal Contraction of Voronoi Regions for Pruning of Blind Decoding Results
    Bai, Dongwoon
    Lee, Jungwon
    Kim, Sungsoo
    Kim, Hanju
    Kang, Inyup
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2015, 63 (06) : 1963 - 1974
  • [24] NEAR-OPTIMAL WEIGHTS IN NONPARAMETRIC REGRESSION UNDER SOME COMMON RESTRICTIONS
    HOLIDAY, DB
    STATISTICS & PROBABILITY LETTERS, 1995, 22 (01) : 33 - 42
  • [25] Analysis of optimal and near-optimal continuous-thrust transfer problems in general circular orbit
    Kechichian, Jean A.
    ACTA ASTRONAUTICA, 2009, 65 (5-6) : 879 - 891
  • [26] Optimal and Near-Optimal Strategies in Discrete Stochastic Multiobjective Quasi-hierarchical Dynamic Problems
    Nowak, Maciej
    Trzaskalik, Tadeusz
    OPERATIONS RESEARCH PROCEEDINGS 2015, 2017, : 295 - 300
  • [27] Near-optimal Linear Decision Trees for k-SUM and Related Problems
    Kane, Daniel M.
    Lovett, Shachar
    Moran, Shay
    JOURNAL OF THE ACM, 2019, 66 (03)
  • [28] A near-optimal sensor placement alaorithm to achieve complete coverage/discrimination in sensor networks
    Lin, FYS
    Chiu, PL
    IEEE COMMUNICATIONS LETTERS, 2005, 9 (01) : 43 - 45
  • [29] Distributed saddle point problems: lower bounds, near-optimal and robust algorithms
    Beznosikov, Aleksandr
    Samokhin, Valentin
    Gasnikov, Alexander
    OPTIMIZATION METHODS & SOFTWARE, 2025,
  • [30] Near-optimal control problems for linear forward-backward stochastic systems
    Huang, Jianhui
    Li, Xun
    Wang, Guangchen
    AUTOMATICA, 2010, 46 (02) : 397 - 404
12345