Kececioglu and Ravi firstly gave a 2-approximation polynomial time algorithm for translocation. They also gave a 3/2-approximation polynomial time algorithm for computation of rearrangement distance for both reversal and translocation.
For the NP-hard problem F 2 | pi j = Xij+αijSij| C max, by defi- ning dominating relations among procssors, the polynomial algorithms are given under the dominating procssors respectively for the general linear deteriorating the flow shop sched- uling problem Fm | pij = Xij+αijSij|Cmax.
对NP难问题F 2| pi j= X ij+αijSij| C max,通过定义处理机间的优势关系,得到处理机在满足优势关系下,线形恶化最小化完工时间的流水作业排序问题Fm | pi j= X ij+αij S ij|Cmax的多项式算法.
On the other hand, we give necessary and sufficient conditions for the existence of ( f -; f +)-factors or (g-, f -; g+, f +)- factors in digraphs according to the theory of network flows. Polynomial algorithms are provided to find an ( f -; f +)-factor or a (g-, f -; g+, f +)-factor in a digraph.
In this note, the author proves that the inverse problem of submodular function on digraphs with l∞ objective function can be solved by strongly polynomial algorithm.
Simple necessary conditions for existence of the desired tree, heuristic rules for displacement of the terminals for which these conditions are not satisfied, and a new polynomial algorithm to determine an approximate solution were presented.
A polynomial algorithm for solving the problem in a rectangular metric is designed.
A polynomial algorithm for processing analytical signals from a sensor array was tested in the analysis of ternary mixtures.
This characterization implies characterizations of some well-known subclasses of the class of well-covered graphs as well as the existence of a polynomial algorithm for the recognition of well-covered graphs with bounded valences.
As admissible solutions (algorithms), it is common practice to study polynomial algorithms, which owe their name to the form of the dependence of time expenditure on the length of the original information.
Investigation of polynomial algorithms for solving the three-index planar assignment problem
Polynomial algorithms for the solution of this problem are proposed.
Investigation of polynomial algorithms for solving the multicriteria three-index planar assignment problem
Polynomial algorithms for solving the vector sum problem