Solving Minimum k-supplier in Adleman-Lipton model
classification
💻 cs.DS
keywords
minimumproblemmodelsolvingsupplieradlemanadleman-liptonalgorithm
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.