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(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
منابع مشابه
Solving maximum cut problems in the Adleman-Lipton model.
In this paper, we consider a procedure for solving maximum cut problems in the Adleman-Lipton model. The procedure works in O(n2) steps for maximum cut problems of an undirected graph with n vertices.
متن کاملSolving the Rural Postman problem using the Adleman-Lipton model
In this survey we investigate the application of the Adleman-Lipton model on Rural Postman problem, which given an undirected graph G = (V,E) with positive integer lengths on each of its edges and a subset E ′ ⊆ E, asks whether there exists a hamiltonian circuit that includes each edge of E ′ and has total cost (sum of edge lengths) less or equal to a given integer B (we are allowed to use any ...
متن کاملSolving the set cover problem and the problem of exact cover by 3-sets in the Adleman-Lipton model.
Adleman wrote the first paper in which it is shown that deoxyribonucleic acid (DNA) strands could be employed towards calculating solutions to an instance of the NP-complete Hamiltonian path problem (HPP). Lipton also demonstrated that Adleman's techniques could be used to solve the NP-complete satisfiability (SAT) problem (the first NP-complete problem). In this paper, it is proved how the DNA...
متن کاملSolving the set cover problem and the problem of exact 3 cover by 3 - sets in the Adleman – Lipton model
9 Adleman wrote the first paper in which it is shown that deoxyribonucleic acid (DNA) strands could be employed towards calculating solutions to an instance of the NP-complete Hamiltonian path problem (HPP). Lipton also demonstrated that Adleman’s techniques could be used to solve the NP-complete satisfiability (SAT) problem (the first NP-complete problem). In this paper, it is proved how the D...
متن کاملMolecular solutions for the Maximum K-colourable Sub graph Problem in Adleman-Lipton model
Adleman [1] showed that deoxyribonucleic acid (DNA) strands could be employed towards calculating solutions to an instance of the Hamiltonian path problem (HPP). Lipton [5] also demonstrated that Adlemans techniques could be used to solve the Satisfiability problem. In this paper, we use Adleman-Lipton model for developing a DNA algorithm to solve Maximum k-colourable Sub graph problem. In spit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1802.00347 شماره
صفحات -
تاریخ انتشار 2018