自动化与信息科学期刊
每年出版 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
352 文章浏览量
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