Solving Minimum K-Supplier in Adleman-Lipton Model

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