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 条
  • [41] Solving constraint satisfaction problems by a genetic algorithm adopting viral infection
    Kanoh, H
    Hasegawa, K
    Matsumoto, M
    Nishihara, S
    Kato, N
    IEEE INTERNATIONAL JOINT SYMPOSIA ON INTELLIGENCE AND SYSTEMS, PROCEEDINGS, 1996, : 67 - 73
  • [42] Performance of the quantum adiabatic algorithm on constraint satisfaction and spin glass problems
    I. Hen
    A.P. Young
    The European Physical Journal Special Topics, 2015, 224 : 63 - 73
  • [43] A conflict Tabu Search Evolutionary Algorithm for solving constraint satisfaction problems
    Craenen, B. G. W.
    Paechter, B.
    EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2008, 4972 : 13 - 24
  • [44] The PPSZ Algorithm for Constraint Satisfaction Problems on More Than Two Colors
    Hertli, Timon
    Hurbain, Isabelle
    Millius, Sebastian
    Moser, Robin A.
    Scheder, Dominik
    Szedlak, May
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2016, 2016, 9892 : 421 - 437
  • [45] The approximability of constraint satisfaction problems
    Khanna, S
    Sudan, M
    Trevisan, L
    Williamson, DP
    SIAM JOURNAL ON COMPUTING, 2001, 30 (06) : 1863 - 1920
  • [46] Compiling constraint satisfaction problems
    Weigel, R
    Faltings, B
    ARTIFICIAL INTELLIGENCE, 1999, 115 (02) : 257 - 287
  • [47] Distance constraint satisfaction problems
    Bodirsky, Manuel
    Dalmau, Victor
    Martin, Barnaby
    Mottet, Antoine
    Pinsker, Michael
    INFORMATION AND COMPUTATION, 2016, 247 : 87 - 105
  • [48] Counting constraint satisfaction problems
    Bulatov, Andrei A.
    PROCEEDINGS OF THE INTERNATIONAL CONGRESS OF MATHEMATICIANS (ICM 2014), VOL IV, 2014, : 561 - 584
  • [49] Constraint satisfaction differential problems
    Cruz, J
    Barahona, P
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 2003, PROCEEDINGS, 2003, 2833 : 259 - 273
  • [50] Belief Constraint Satisfaction Problems
    Rouahi, Aouatef
    Ben Salah, Kais
    Ghedira, Khaled
    2015 IEEE/ACS 12TH INTERNATIONAL CONFERENCE OF COMPUTER SYSTEMS AND APPLICATIONS (AICCSA), 2015,
12345