This paper proposes several approximation algorithms to improve the solution of snowblower problem.
提出了吹雪机问题的改进近似算法。
Many approximation algorithms behave well in frequent items mining, but can not control their memory consumption.
许多近似算法能够有效进行频繁项挖掘，但不能有效控制内存资源消耗。
Develops cutting plane methods, integral basis methods, enumerative and heuristic methods and approximation algorithms.
阐述割平面方法、整基方法、枚举和启发式方法和逼近算法。
For both problems, we study their computational complexity and present optimal algorithms or polynomial time approximation algorithms.
并且对这两类问题都研究了他们的计算复杂性并给出了最优算法或者多项式时间近似算法。
Analysis of reliability to the complex network is a NP-Hard problem. Searching for simple and accurate approximation algorithms has high application value.
大型复杂网络的可靠性分析都是NP难题，寻求计算简单、准确的近似算法更具应用价值。
As the task allocation problem is a recognized NP-hard problem, constructing effective approximation algorithms ro heuristic algorithms is a research focus.
由于任务分配问题是NP困难问题，构造有效的近似算法或启发式算法是目前研究的热点。
It is shown that under suitable conditions by the viscosity approximation algorithms, some strong convergence theorems for approximating to this common elements are proved.
在一定的条件下，用黏性逼近法证明了序列逼近于这一公共元的强收敛定理。
It is shown that under suitable conditions by the viscosity approximation algorithms, some strong convergence theorems for approximating to this common elements are proved.
在一定的条件下，用黏性逼近法证明了序列逼近于这一公共元的强收敛定理。
应用推荐