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 条
12345