Solving Minimum k-supplier in Adleman-Lipton model

TL;DR

This paper presents a polynomial-time algorithm within the Adleman-Lipton model for solving the NP-hard minimum k-supplier problem in undirected graphs, advancing quantum algorithm applications in combinatorial optimization.

Contribution

It introduces a novel polynomial-time quantum algorithm for the minimum k-supplier problem using the Adleman-Lipton model, addressing an NP-hard problem.

Findings

Algorithm operates in polynomial steps

Applicable to undirected graphs with n vertices

Addresses an NP-hard combinatorial optimization problem

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.