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 条
  • [1] On Sublinear Algorithms of Reoptimization for Constraint Satisfaction Problems
    Mikhailyuk, V. A.
    JOURNAL OF AUTOMATION AND INFORMATION SCIENCES, 2013, 45 (04) : 30 - 38
  • [2] REOPTIMIZATION OF CONSTRAINT SATISFACTION PROBLEMS WITH APPROXIMATION RESISTANT PREDICATES
    Mikhailyuka, V. A.
    Sergienko, I. V.
    CYBERNETICS AND SYSTEMS ANALYSIS, 2012, 48 (01) : 73 - 85
  • [3] Reoptimization of constraint satisfaction problems with approximation resistant predicates
    V. A. Mikhailyuk
    I. V. Sergienko
    Cybernetics and Systems Analysis, 2012, 48 (1) : 73 - 85
  • [4] Optimal Approximate Algorithm for Reoptimization of Strict Constraint Satisfaction Problems
    Mikhailyuk, V. A.
    JOURNAL OF AUTOMATION AND INFORMATION SCIENCES, 2012, 44 (11) : 45 - 54
  • [5] Lexicographically-ordered constraint satisfaction problems
    Freuder, Eugene C.
    Heffernan, Robert
    Wallace, Richard J.
    Wilson, Nic
    CONSTRAINTS, 2010, 15 (01) : 1 - 28
  • [6] Lexicographically-ordered constraint satisfaction problems
    Eugene C. Freuder
    Robert Heffernan
    Richard J. Wallace
    Nic Wilson
    Constraints, 2010, 15 : 1 - 28
  • [7] Generalized counting constraint satisfaction problems with determinantal circuits
    Morton, Jason
    Turner, Jacob
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2015, 466 : 357 - 381
  • [8] Large Neighborhood Search for Robust Solutions for Constraint Satisfaction Problems with Ordered Domains
    López, Jheisson
    Arbelaez, Alejandro
    Climent, Laura
    Leibniz International Proceedings in Informatics, LIPIcs, 2022, 235
  • [9] Finding robust solutions for constraint satisfaction problems with discrete and ordered domains by coverings
    Laura Climent
    Richard J. Wallace
    Miguel A. Salido
    Federico Barber
    Artificial Intelligence Review, 2015, 44 : 131 - 156
  • [10] Finding robust solutions for constraint satisfaction problems with discrete and ordered domains by coverings
    Climent, Laura
    Wallace, Richard J.
    Salido, Miguel A.
    Barber, Federico
    ARTIFICIAL INTELLIGENCE REVIEW, 2015, 44 (02) : 131 - 156
12345