arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.00347cs.DS
收藏

Adleman-Lipton模型中最小k-供应商的求解

Solving Minimum k-supplier in Adleman-Lipton model

Saeid Safaei, Vahid Safaei, Elizabeth D. Trippe, Karen Aguar, Hamid R. Arabnia

摘要:

在本文中,我们考虑的最小k供应商问题的Adleman Lipton模型的解决算法。对于n阶无向图的最小k个供应商问题,该方法是一个NP难的组合优化问题,其求解步骤是多项式的.

英文摘要:

In this paper, we consider an algorithm for solving the minimum k supplier problem using the Adleman Lipton model. The procedure works in polynomial steps for the minimum k supplier problem of an undirected graph with n vertices, which is an NP hard combinatorial optimization problem.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑