Solving Minimum k-supplier in Adleman-Lipton model
Data Structures and Algorithms
2018-02-02 v1
Abstract
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.
Cite
@article{arxiv.1802.00347,
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},
journal= {arXiv preprint arXiv:1802.00347},
year = {2018}
}