Optimal Approximate Algorithm for Reoptimization of Strict 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卷 / 11期
关键词：
optimal approximate algorithm; approximation ratio; integrality gap on l inear relaxation; hierarchy of relaxation; unique game problem; RELAXATIONS; HARDNESS;
D O I：
10.1615/JAutomatInfScien.v44.i11.40
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
With the unique games conjecture (UGC) held there exists the optimal approximate algorithm for reoptimization of strict constraint satisfaction problems (under insertion of any constraint). The approximation ratio of this algorithm depends on the integrality gap on linear relaxation of the original problem.
引用
收藏
页码：45 / 54
页数：10
相关论文
共 50 条
  • [21] A Fast Filtering Algorithm for Continuous Constraint Satisfaction Problems
    Van Lam Ho
    Lai, K. Robert
    2019 IEEE - RIVF INTERNATIONAL CONFERENCE ON COMPUTING AND COMMUNICATION TECHNOLOGIES (RIVF), 2019, : 48 - 53
  • [22] CONSTRAINT ALGORITHM FOR EXTREMALS IN OPTIMAL CONTROL PROBLEMS
    Barbero-Linan, Maria
    Munoz-Lecanda, Miguel C.
    INTERNATIONAL JOURNAL OF GEOMETRIC METHODS IN MODERN PHYSICS, 2009, 6 (07) : 1221 - 1233
  • [23] Distributed constraint satisfaction algorithm for complex local problems
    Yokoo, M
    Hirayama, K
    INTERNATIONAL CONFERENCE ON MULTI-AGENT SYSTEMS, PROCEEDINGS, 1998, : 372 - 379
  • [24] 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
  • [25] Near-Optimal Algorithms for Maximum Constraint Satisfaction Problems
    Charikar, Moses
    Makarychev, Konstantin
    Makarychev, Yury
    ACM TRANSACTIONS ON ALGORITHMS, 2009, 5 (03)
  • [26] An optimal algorithm based on the solution to the coarse-grained arc consistency algorithms of the Constraint satisfaction Problems
    Yang, Gang
    Li, Huifeng
    Cao, Can
    Chen, Siyuan
    Zhao, Yubo
    PROCEEDINGS OF THE 2015 INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INTELLIGENT COMMUNICATION, 2015, 16 : 12 - 17
  • [27] A tabu search evolutionary algorithm for solving constraint satisfaction problems
    Craenen, B. G. W.
    Paechter, B.
    PARALLEL PROBLEM SOLVING FROM NATURE - PPSN IX, PROCEEDINGS, 2006, 4193 : 152 - 161
  • [28] A Variable Depth Search Algorithm for Binary Constraint Satisfaction Problems
    Bouhmala, N.
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2015, 2015
  • [29] Decomposing Constraint Satisfaction Problems by Means of Meta Constraint Satisfaction Optimization Problems
    Loeffler, Sven
    Liu, Ke
    Hofstedt, Petra
    PROCEEDINGS OF THE 11TH INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE (ICAART), VOL 2, 2019, : 755 - 761
  • [30] Approximate constraint satisfaction over a constraint hierarchy: A preliminary study
    Ryu, YU
    PROCEEDINGS OF THE THIRTY-FIRST HAWAII INTERNATIONAL CONFERENCE ON SYSTEM SCIENCES, VOL V: MODELING TECHNOLOGIES AND INTELLIGENT SYSTEMS TRACK, 1998, : 134 - 141
12345