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

年間 12 号発行

ISSN 印刷: 1064-2315

ISSN オンライン: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

On Sublinear Algorithms of Reoptimization for Constraint Satisfaction Problems

巻 45, 発行 4, 2013, pp. 30-38
DOI: 10.1615/JAutomatInfScien.v45.i4.40
Get accessGet access

要約

For solving Ins-Λ-CSP (reoptimization of Λ-CSP under insertion of one constraint) there exists an optimal approximation algorithm with additive error of constant complexity. Approximation ratio of this algorithm depends on the integrality gap of LP relaxation of the initial problem.

Begell Digital Portal Begellデジタルライブラリー 電子書籍 ジャーナル 参考文献と会報 リサーチ集 価格及び購読のポリシー Begell House 連絡先 Language English 中文 Русский Português German French Spain