an approximation algorithm is presented for minimizing a nondecreasing supermodular set function, and its performance guarantee is probed.
给出了求解一类具有简单约束的上模集函数最小值问题的一种局部搜索法,并讨论了所给算法的性能保证。
an approximation algorithm is proposed in this paper based on the concept of incidence matrix in graph.
该文利用图论中关联矩阵的概念,提出了一个近似算法,并分析了算法的复杂性。
for no-waited model, we show it is strongly np-hard, and present a pseudo-polynomial time optimal algorithm and an approximation algorithm with worst-case ratio 5/3.
对于不可等待的情况证明了它是强np-难的,并给出了动态规划算法和一个最坏情况界为5/3的近似算法。
an approximation algorithm for solving shortest path improvement problem under hamming distance;
给出了求解含有禁止路线网络中的最短路问题的一个算法 。
first, an approximation algorithm for self-tuning regulator is suggested.
首先提出了自校正调节器的一种近似算法。
by normalizing the total processing time, we present an approximation algorithm and investigate its competitive ratio proved to be tight.
将总加工时间标準化后,给出近似算法及其竞争比,并证明此竞争比是紧的。
an approximation algorithm is proposed, and its time complexity and approximation ratio are analyzed.
提出了一种基于贪婪策略的近似算法,并分析了算法的时间复杂性和近似比。
an approximation algorithm was given to find an out-branching with many leaves in the reduced digraph. furthermore, some optimization rules were given to improve the out-branching.
对于用近似算法求得的出分枝,又结合前面的规约规则设计了优化规则,以进一步通过优化变换增加出分枝的叶子节点。