图书馆订阅: Guest
自动化与信息科学期刊

每年出版 12 

ISSN 打印: 1064-2315

ISSN 在线: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

Reoptimization of Ordered Generalized Constraint Satisfaction Problems

卷 44, 册 6, 2012, pp. 61-70
DOI: 10.1615/JAutomatInfScien.v44.i6.60
Get accessGet access

摘要

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.

对本文的引用
  1. Mikhailyuk Victor A., The Complexity of Approximation Reoptimization Algorithms for Discrete Optimization, in Optimization Methods and Applications, 130, 2017. Crossref

Begell Digital Portal Begell 数字图书馆 电子图书 期刊 参考文献及会议录 研究收集 订购及政策 Begell House 联系我们 Language English 中文 Русский Português German French Spain