Some examples of polynomial time algorithms: Theselection sortsorting algorithm onnintegers performs{\displaystyle An^{2}} operations for some constantA. Thus it runs in time{\displaystyle O(n^{2})} and is a polynomial time algorithm. All the basic arithmetic operations (addition, subtraction, mu...
1)polynomial time algorithm多项式时间算法 1.A polynomial time algorithm for the scheduling problem of identical coupled-task jobs is presented in.本文讨论并给出了由n个相同的耦合工件构成的耦合工件组作业问题的多项式时间算法。 2.To present a new polynomial time algorithm for China traveling salesman pr...
We design a O(n~3) polynomial time algorithm for finding a (k - 1)- regular subgraph in a k-regular graph without any induced star K_(1.3)(claw-free). A polynomial time algorithm for rinding a cubic subgraph in a 4-regular locally connected graph is also given. A family of fc-re...
As a first ingredient, we need apolynomial timealgorithm for the following problem: Given ann-element setY, a system ℛ of subsets ofY, and a parameterr, we want to compute a (1/r)-approximation of sizes=O(r2logr). This is much weaker thanTheorem 4.2, since we only want time poly...
This paper deals with the capacity constrained time slot assignment problem(CTSAP) that a satellite switches to traffic between ground stations using on-board k-transponders switching modes in SS/TDMA time-division technology. There was no polynomial time algorithm to solve the optimal solution thus...
The article presents information on polynomially bounded algorithm. It refers to an algorithm for which it can be shown that the number of steps required to find a solution to a problem is bounded by a polynomial function of the problem's data....
Examples ofpolynomialin a Sentence Recent Examples on the Web Examples are automatically compiled from online sources to show current usage.Opinions expressed in the examples do not represent those of Merriam-Webster or its editors.Send us feedback. ...
We consider a polynomial-time algorithm for the following scheduling problem: Given two machines, where each machine can process at most one job at a time; a set of jobs, where each job can start on or after its release date and consists of a chain of unit-time operations such that the...
Lakshmi Prabha S, T.N.Janakiraman, Polynomial-time Approxima- tion Algorithm for finding Highly Comfortable Team in any given So- cial Network, ArXiv, 18 May 2014, http://arxiv.org/abs/1405.4534 or http://arxiv.org/pdf/1405.4534v1.pdf....
Intuitively, such graphs are obtained by gluing together, in a tree-like structure, any set of graphs for which the min-ranks can be determined in polynomial time. A polynomial time algorithm to recognize such graphs is also proposed. 展开 ...