Solving Minimum k-supplier in Adleman-Lipton model

  title={Solving Minimum k-supplier in Adleman-Lipton model},
  author={Saeid Safaei and Vahid Safaei and Elizabeth D. Trippe and Karen Aguar and Hamid R. Arabnia},
In this paper, we consider an algorithm for solving the minimum k-supplier problem using the Adleman–Lipton model. The procedure works in O(n) steps for the minimum k-supplier problem of an undirected graph with n vertices, which is an NP-hard combinatorial optimization problem. Keywords-DNA Computing, minimum k-supplier, AdlemanLipton