Reoptimization of Ordered Generalized Constraint Satisfaction Problems

被引：0
|
作者：
Mikhailyuk, V. A. [1 ]
机构：
[1] Natl Acad Sci Ukraine, VM Glushkov Cybernet Inst, Kiev, Ukraine
来源：
JOURNAL OF AUTOMATION AND INFORMATION SCIENCES | 2012年 / 44卷 / 06期
关键词：
unique games conjecture; solving the Ins-OCSP problem; reoptimization; polynomial optimal (threshold) approximate algorithm; approximation ratio; INAPPROXIMABILITY; APPROXIMATION; HARDNESS;
D O I：
10.1615/JAutomatInfScien.v44.i6.60
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
While the truth of the unique games conjecture (UGC), for solving the Ins-OCSP problem (OCSP reoptimization, when adding a single constraint), there exists a polynomial optimal (threshold) approximate algorithm. Its approximation ratio depends on the threshold "random" approximation ratio for solving the OCSP problem.
引用
收藏
页码：61 / 70
页数：10
相关论文
共 50 条
  • [41] Tractability in constraint satisfaction problems: a survey
    Carbonnel, Clement
    Cooper, Martin C.
    CONSTRAINTS, 2016, 21 (02) : 115 - 144
  • [42] Uncertainty in dynamic constraint satisfaction problems
    Climent, Laura
    Salido, Miguel A.
    Wallace, Richard J.
    Barber, Federico
    AI COMMUNICATIONS, 2016, 29 (01) : 239 - 241
  • [43] Structuring techniques for constraint satisfaction problems
    Weigel, R
    Faltings, BV
    IJCAI-97 - PROCEEDINGS OF THE FIFTEENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 AND 2, 1997, : 418 - 423
  • [44] Solving fuzzy constraint satisfaction problems
    Meseguer, P
    Larrosa, J
    PROCEEDINGS OF THE SIXTH IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS, VOLS I - III, 1997, : 1233 - 1238
  • [45] Reoptimization of parameterized problems
    Boeckenhauer, Hans-Joachim
    Burjons, Elisabet
    Raszyk, Martin
    Rossmanith, Peter
    ACTA INFORMATICA, 2022, 59 (04) : 427 - 450
  • [46] Parameterized complexity of constraint satisfaction problems
    Dániel Marx
    computational complexity, 2005, 14 : 153 - 183
  • [47] On the tractability of smooth constraint satisfaction problems
    Kumar, TKS
    INTEGRATION OF AI AND OR TECHNIQUES IN CONSTRAINT PROGRAMMING FOR COMBINATORIAL OPTIMIZATION PROBLEMS, 2005, 3524 : 304 - 319
  • [48] Tractability in constraint satisfaction problems: a survey
    Clément Carbonnel
    Martin C. Cooper
    Constraints, 2016, 21 : 115 - 144
  • [49] ROBUSTNESS IN DYNAMIC CONSTRAINT SATISFACTION PROBLEMS
    Climent, Laura
    Salido, Miguel A.
    Barber, Federico
    INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2012, 8 (04): : 2513 - 2532
  • [50] Argumentation Frameworks as Constraint Satisfaction Problems
    Amgoud, Leila
    Devred, Caroline
    SCALABLE UNCERTAINTY MANAGEMENT, 2011, 6929 : 110 - +
12345