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
要約
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.
キーワード: unique games conjecture, solving the Ins-OCSP problem, reoptimization, polynomial optimal (threshold) approximate algorithm, approximation ratio.
によって引用された
-
Mikhailyuk Victor A., The Complexity of Approximation Reoptimization Algorithms for Discrete Optimization, in Optimization Methods and Applications, 130, 2017. Crossref
351 記事の閲覧数
10 記事のダウンロード
記事の統計
類似内容の記事:
最新号
Modeling of Configurations Formed when Using Microneedle Systems
Properties of Large Deviations of Empirical Estimates in a Stochastic Optimization Problem for a Homogeneous Random Field
The Dynamics of One Arms Race Mathematical Model with a Delay
Some Ways to Modeling Input Data for Information Search in the Library of Standards when Solving Semantics Problems
Method for Constructing Primitive Polynomials for Cryptographic Subsystems of Dependable Automated Systems
Complete Asymptotics of Approximations by Certain Singular Integrals in Mathematical Modeling
Index, Volume 52, 2020