Completely inapproximable monotone and antimonotone parameterized problems

被引：14
|
作者：
Marx, Daniel [1 ]
机构：
[1] Hungarian Acad Sci MTA SZTAKI, Comp & Automat Res Inst, Budapest, Hungary
来源：
JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 2013年 / 79卷 / 01期
基金：
欧洲研究理事会;
关键词：
Inapproximability; Fixed-parameter tractability; Circuits; Circuit satisfiability; APPROXIMATION; APPROXIMABILITY;
D O I：
10.1016/j.jcss.2012.09.001
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
We prove that weighted circuit satisfiability for monotone or antimonotone circuits has no fixed-parameter tractable approximation algorithm with any approximation ratio function rho, unless FPT not equal W[1]. In particular, not having such an fpt-approximation algorithm implies that these problems have no polynomial-time approximation algorithms with ratio rho(OPT) for any nontrivial function rho. (C) 2012 Elsevier Inc. All rights reserved.
引用
收藏
页码：144 / 151
页数：8
相关论文
共 50 条
  • [41] COMPLETELY MONOTONE FUNCTIONS ON C+(X)
    HOFFMANNJORGENSEN, J
    RESSEL, P
    MATHEMATICA SCANDINAVICA, 1977, 40 (01) : 79 - 93
  • [42] A completely monotone function related to the Gamma function
    Berg, C
    Pedersen, HL
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2001, 133 (1-2) : 219 - 230
  • [43] APPROXIMATING LEVY PROCESSES WITH COMPLETELY MONOTONE JUMPS
    Hackmann, Daniel
    Kuznetsov, Alexey
    ANNALS OF APPLIED PROBABILITY, 2016, 26 (01): : 328 - 359
  • [44] Succinct Monotone Circuit Certification: Planarity and Parameterized Complexity
    Alves, Mateus Rodrigues
    Oliveira, Mateus de Oliveira
    Nascimento Silva, Janio Carlos
    Souza, Ueverton dos Santos
    COMPUTING AND COMBINATORICS (COCOON 2020), 2020, 12273 : 496 - 507
  • [45] Dynamic Parameterized Problems
    R. Krithika
    Abhishek Sahu
    Prafullkumar Tale
    Algorithmica, 2018, 80 : 2637 - 2655
  • [46] Parameterized counting problems
    McCartin, C
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2002, 2002, 2420 : 556 - 567
  • [47] Reoptimization of parameterized problems
    Boeckenhauer, Hans-Joachim
    Burjons, Elisabet
    Raszyk, Martin
    Rossmanith, Peter
    ACTA INFORMATICA, 2022, 59 (04) : 427 - 450
  • [48] Parameterized resiliency problems
    Crampton, Jason
    Gutin, Gregory
    Koutecky, Martin
    Watrigant, Remi
    THEORETICAL COMPUTER SCIENCE, 2019, 795 : 478 - 491
  • [49] Parameterized counting problems
    McCartin, C
    ANNALS OF PURE AND APPLIED LOGIC, 2006, 138 (1-3) : 147 - 182
  • [50] Parameterized approximation problems
    Downey, Rodney G.
    Fellows, Michael R.
    McCartin, Catherine
    PARAMETERIZED AND EXACT COMPUTATION,PROCEEDINGS, 2006, 4169 : 121 - 129
12345