NP困难 1. The problem is proved to be NP-hard by an instance that the polynomial of the knapsack problem is reduced to this problem. 针对Hamming距离下的最短路逆问题,分析了最优解的性质,给出并证明了问题存在可行解的充分必要条件;利用把背包问题的实例多项式归约到该问题的实例,证明了该问题为NP...
The authors we lodged a method of reducing the solving difficulty the creative method of nonequivalence single restrict, aim at a kind of combination and optimize problem multi dimension 0 1 knapsack problem(also called the NP hard problem). 针对一类组合优化问题—多维 0 - 1背包问题 ( MKP) ...
(dags), We prove that the problem is strongly NP-hard. Our result implies that for arbitrary dags, there is no pseudo-polynomial time algorithm to obtain the exact solution unless P=NP. We also prove that the absolute approximation discrete gate sizing problem is strongly NP-hard. These ...
We prove that it is strongly NP-hard to decide whether a polygonal chain with fixed edge lengths and angles has a planar configuration without crossings. In particular, flattening is NP-hard when all the edge lengths are equal, whereas a previous (weak) NP-hardness proof used lengths that ...
We also prove that the absolute approximation discrete gate sizing problem is strongly NP-hard. These results provide insight into the difficulties of the problem and may lead to better heuristics 展开 关键词: Theoretical or Mathematical/ combinatorial circuits computational complexity graph theory logic...
aThus, the algorithms that consider moving the rectangles along the x-axis do not[translate] arove that RPP is strongly NP-hard and discuss a special case which is polynomially[translate]
[T.C.E. Cheng, C.T. Ng, J.J. Yuan, The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard, Journal of Scheduling 6 (2003) 483–490] proved that this problem is strongly NP-hard. This answers a long-standing open problem posed by...
In this note, we resolve the question and prove that, contrary to the expectations of the authors, the given problem is strongly NP-hard (already in the simplest non-trivial case of four layers). Hence it is unlikely that there would be an efficient (polynomial or pseudo-polynomial) ...
First, the problems of locating minimum weight dominating sets and minimum weight independent dominating sets in strongly chordal graphs with real vertex weights can be solved in polynomial time, whereas each of these problems is NP-hard for chordal graphs. Moreover, every well-described class of ...
We generalize the concept of strong walk-regularity to directed graphs. We call a digraph strongly-walk-regular withif the number of walks of lengthfrom a vertex to another vertex depends only on whether the first vertex is the same as, adjacent to, or not adjacent to the second vertex. ...