ライブラリ登録: Guest
Journal of Automation and Information Sciences

年間 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