2000 character limit reached
Solving Minimum k-supplier in Adleman-Lipton model
Published 17 Jan 2018 in cs.DS | (1802.00347v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.