单纯形算法是NP强的
The Simplex Algorithm is NP-mighty
摘要:
我们建议通过算法可以用来解决的问题的复杂性来对算法的能力进行分类。而不是限制的问题,一个特定的算法的目的是明确解决,但是,我们包括的问题,多项式开销,可以解决“隐式”在算法的执行。例如,我们允许通过适当地转换输入,执行算法,并观察其内部配置中的特定位是否在执行期间切换来解决决策问题。我们表明,单纯形法,网络单纯形法(都与Dantzig的原始枢轴规则),和连续最短路径算法是NP强大的,也就是说,这些算法都可以用来解决任何问题的NP。这一结果对这些算法的指数最坏情况运行时间投下了更有利的光。此外,作为我们的方法的结果,我们得到了一些新的硬度结果。例如,对于单纯形算法的给定输入,决定给定变量是否在算法执行期间进入基础并确定所需的迭代次数都是NP难问题。最后,我们关闭了一个长期存在的开放问题,在该地区的网络流量随着时间的推移,最早到达的流量是NP难获得。
英文摘要:
We propose to classify the power of algorithms by the complexity of the problems that they can be used to solve. Instead of restricting to the problem a particular algorithm was designed to solve explicitly, however, we include problems that, with polynomial overhead, can be solved 'implicitly' during the algorithm's execution. For example, we allow to solve a decision problem by suitably transforming the input, executing the algorithm, and observing whether a specific bit in its internal configuration ever switches during the execution. We show that the Simplex Method, the Network Simplex Method (both with Dantzig's original pivot rule), and the Successive Shortest Path Algorithm are NP-mighty, that is, each of these algorithms can be used to solve any problem in NP. This result casts a more favorable light on these algorithms' exponential worst-case running times. Furthermore, as a consequence of our approach, we obtain several novel hardness results. For example, for a given input to the Simplex Algorithm, deciding whether a given variable ever enters the basis during the algorithm's execution and determining the number of iterations needed are both NP-hard problems. Finally, we close a long-standing open problem in the area of network flows over time by showing that earliest arrival flows are NP-hard to obtain.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。