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 条
  • [1] On some classes of optimal and near-optimal polynomial codes
    Aydin, N
    Ray-Chaudhuri, DK
    FINITE FIELDS AND THEIR APPLICATIONS, 2004, 10 (01) : 24 - 35
  • [2] Near-optimal control for stochastic recursive problems
    Hui, Eddie
    Huang, Jianhui
    Li, Xun
    Wang, Guangchen
    SYSTEMS & CONTROL LETTERS, 2011, 60 (03) : 161 - 168
  • [3] Near-Optimal Quantum Algorithms for String Problems
    Akmal, Shyan
    Jin, Ce
    ALGORITHMICA, 2023, 85 (08) : 2260 - 2317
  • [4] Near-Optimal Quantum Algorithms for String Problems
    Akmal, Shyan
    Jin, Ce
    PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2022, : 2791 - 2832
  • [5] Near-Optimal Quantum Algorithms for String Problems
    Shyan Akmal
    Ce Jin
    Algorithmica, 2023, 85 : 2260 - 2317
  • [6] Generating optimal and near-optimal solutions to facility location problems
    Church, Richard L.
    Baez, Carlos A.
    ENVIRONMENT AND PLANNING B-URBAN ANALYTICS AND CITY SCIENCE, 2020, 47 (06) : 1014 - 1030
  • [7] SOLVING SOME GRAPH PROBLEMS WITH OPTIMAL OR NEAR-OPTIMAL SPEEDUP ON MESH-OF-TREES NETWORKS.
    Huang, Ming-Deh A.
    Annual Symposium on Foundations of Computer Science (Proceedings), 1985, : 232 - 240
  • [8] Near-Optimal Sensor Placement for Linear Inverse Problems
    Ranieri, Juri
    Chebira, Amina
    Vetterli, Martin
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2014, 62 (05) : 1135 - 1146
  • [9] Near-Optimal Algorithms for Maximum Constraint Satisfaction Problems
    Charikar, Moses
    Makarychev, Konstantin
    Makarychev, Yury
    ACM TRANSACTIONS ON ALGORITHMS, 2009, 5 (03)
  • [10] Near-Optimal Algorithms for Maximum Constraint Satisfaction Problems
    Charikar, Moses
    Makarychev, Konstantin
    Makarychev, Yury
    PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2007, : 62 - 68
12345