...类问题是允许多项式时间近似算法且近似比在常数范围内的NP优化问题的集合，这种多项式时间复杂度且近似比（approximation ratio）在常数范围近似算法也称为constant-factor approximation algorithms。
基于20个网页-相关网页
Approximation optimizing problem of this scheduling model has also been discussed theoretically. Based on the strong NP-hard problem, the article has proofed it impossible to get a polynomial schedule algorithm with constant number of the approximation ratio.
并从理论上探讨了该调度模型的近似优化问题的难度，在强NP-难的基础上证明了不存在一个多项式时间的常数近似比的调度算法。
参考来源 - 网络并行计算环境中基于多处理机任务的调度研究Next, we study the computational effect of the algorithm through experiment. The statistical results show that the average approximation ratio of all instances involved in the experiment is smaller than 1.001.
随后，利用实验进一步研究了算法的实际计算效果，统计结果发现，参与实验的所有实例实际求解结果的平均近似度小于1.001；进一步分析实验结果，我们又提出了算法的改进方法。
参考来源 - 设施选址与K·2,447,543篇论文数据，部分数据来源于NoteExpress
Simulation results show that the proposed algorithm can significantly reduce the risk of security-critical real time applications and satisfy the bound of risk approximation ratio.
实验结果显示所提算法能明显降低安全关键实时应用的风险。
Maintaining the ratio of working to retirement years is a reasonable first approximation to a guideline for determining the eligible age for retirement and health benefits.
维持工作和退休时间的比率是决定退休和医疗保障的合适年龄的第一步。
By normalizing the total processing time, we present an approximation algorithm and investigate its competitive ratio proved to be tight.
将总加工时间标准化后，给出近似算法及其竞争比，并证明此竞争比是紧的。
应用推荐