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 条
  • [21] Distance Constraint Satisfaction Problems
    Bodirsky, Manuel
    Dalmau, Victor
    Martin, Barnaby
    Pinsker, Michael
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2010, 2010, 6281 : 162 - +
  • [22] The Complexity of Constraint Satisfaction Problems
    Bodirsky, Manuel
    32ND INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2015), 2015, 30 : 2 - 9
  • [23] Full constraint satisfaction problems
    Feder, Tomas
    Hell, Pavol
    SIAM JOURNAL ON COMPUTING, 2006, 36 (01) : 230 - 246
  • [24] Locked constraint satisfaction problems
    Zdeborova, Lenka
    Mezard, Marc
    PHYSICAL REVIEW LETTERS, 2008, 101 (07)
  • [25] On reformulation of constraint satisfaction problems
    Weigel, R
    Bliek, C
    ECAI 1998: 13TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 1998, : 254 - 258
  • [26] Nonuniform Boolean Constraint Satisfaction Problems with Cardinality Constraint
    Creignou, Nadia
    Schnoor, Henning
    Schnoor, Ilka
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2010, 11 (04) : 1 - 32
  • [27] A Meta Constraint Satisfaction Optimization Problem for the Optimization of Regular Constraint Satisfaction Problems
    Loeffler, Sven
    Liu, Ke
    Hofstedt, Petra
    PROCEEDINGS OF THE 11TH INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE (ICAART), VOL 2, 2019, : 435 - 442
  • [28] A constraint directed model for partial constraint satisfaction problems
    Nagarajan, S
    Goodwin, S
    Sattar, A
    ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2000, 1822 : 26 - 39
  • [29] Reoptimization of parameterized problems
    Hans-Joachim Böckenhauer
    Elisabet Burjons
    Martin Raszyk
    Peter Rossmanith
    Acta Informatica, 2022, 59 : 427 - 450
  • [30] Constraint Satisfaction Technology for Stacking Problem with Ordered Constraints
    Hou, Dong-liang
    Chen, Fang-rong
    2012 INTERNATIONAL WORKSHOP ON INFORMATION AND ELECTRONICS ENGINEERING, 2012, 29 : 3317 - 3321
12345