Approximation Algorithms for NP-Hard Problems

Approximation Algorithms for NP-Hard Problems

Pranav Bhalerao, Areen Bhalekar, Asit Gaikwad, Pratik Jadhav, Himanshu Gharpure

Electronics and Telecommunication Department, Vishwakarma Institute of Information Technology

SurveyNo.3/4, Kondhwa (Budruk), Pune, Maharashtra, India-411048

Abstract--What is more, there is an approximation algorithms which assist in solving NP-hard problems. It is in this method that we achieve the solution within the performance bound using the heuristics and algorithms. In this article also, two more distinct types of techniques namely; Clustering, Optimization and Machine Learning Augmentation techniques are addressed. Explains the timelines for AI & Quantum Computing; unveils use of AI in networks & technologies, genomes pharmaceuticals, scheduling & resource allocation.

Keywords: Approximation, Approximation Scheme, Randomized Algorithms, NP-Hard, Computational, Complexity, Optimization Algorithms, Design of Algorithms