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 条
  • [31] A new algorithm for optimal 2-constraint satisfaction and its implications
    Williams, R
    THEORETICAL COMPUTER SCIENCE, 2005, 348 (2-3) : 357 - 365
  • [32] Decimation Algorithm Based on Correlations for Constraint Satisfaction Problems on Random Networks
    Higuchi, Saburo
    2009 7TH INTERNATIONAL SYMPOSIUM ON MODELING AND OPTIMIZATION IN MOBILE, AD HOC, AND WIRELESS, 2009, : 473 - 477
  • [33] Performance of the quantum adiabatic algorithm on constraint satisfaction and spin glass problems
    Hen, I.
    Young, A. P.
    EUROPEAN PHYSICAL JOURNAL-SPECIAL TOPICS, 2015, 224 (01): : 63 - 73
  • [34] An Arc-Consistency Algorithm for Dynamic and Distributed Constraint Satisfaction Problems
    Georg Ringwelski
    Artificial Intelligence Review, 2005, 24 : 431 - 454
  • [35] A New Multi-Agent Algorithm for Solving Constraint Satisfaction Problems
    Moghaddas, Raziyeh
    Mansoori, Eghbal
    Hamzeh, Ali
    2013 5TH CONFERENCE ON INFORMATION AND KNOWLEDGE TECHNOLOGY (IKT), 2013, : 197 - 201
  • [36] Improving the efficiency of forward checking algorithm for solving constraint satisfaction problems
    Farhang, Yusef
    Meybodi, M. R.
    Hatamlou, A. R.
    ISDA 2008: EIGHTH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS DESIGN AND APPLICATIONS, VOL 1, PROCEEDINGS, 2008, : 240 - +
  • [37] A residual-based message passing algorithm for constraint satisfaction problems
    Chun-Yan Zhao
    Yan-Rong Fu
    Jin-Hua Zhao
    CommunicationsinTheoreticalPhysics, 2022, 74 (03) : 81 - 90
  • [38] A residual-based message passing algorithm for constraint satisfaction problems
    Zhao, Chun-Yan
    Fu, Yan-Rong
    Zhao, Jin-Hua
    COMMUNICATIONS IN THEORETICAL PHYSICS, 2022, 74 (03)
  • [39] An arc-consistency algorithm for dynamic and distributed constraint satisfaction problems
    Ringwelski, G
    ARTIFICIAL INTELLIGENCE REVIEW, 2005, 24 (3-4) : 431 - 454
  • [40] Discrete Focus Group Optimization Algorithm for Solving Constraint Satisfaction Problems
    Bidar, Mahdi
    Mouhoub, Malek
    Sadaoui, Samira
    ICAART: PROCEEDINGS OF THE 12TH INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE, VOL 2, 2020, : 322 - 330
12345