Typical Performance of Approximation Algorithms for NP-hard Problems
نویسندگان
چکیده
Typical performance of approximation algorithms is studied for randomized minimum vertex cover problems. A wide class of random graph ensembles characterized by an arbitrary degree distribution is discussed with the presentation of a theoretical framework. Herein, three approximation algorithms are examined: linearprogramming relaxation, loopy-belief propagation, and a leaf-removal algorithm. The former two algorithms are analyzed using a statistical–mechanical technique, whereas the average-case analysis of the last one is conducted using the generating function method. These algorithms have a threshold in the typical performance with increasing average degree of the random graph, below which they find true optimal solutions with high probability. Our study reveals that there exist only three cases determined by the order of the typical performance thresholds. In addition, we provide some conditions for classification of the graph ensembles and demonstrate explicitly some examples for the difference in thresholds. PACS numbers: 75.10.Nr, 02.60.Pn, 05.20.-y, 89.70.Eg
منابع مشابه
Solving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm
The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution. Although the MTSP is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. This paper presents an efficient and evolutionary optimization algorith...
متن کاملFully Polynomial Time Approximation Schemes
Recall that the approximation ratio for an approximation algorithm is a measure to evaluate the approximation performance of the algorithm. The closer the ratio to 1 the better the approximation performance of the algorithm. It is notable that there is a class of NP-hard optimization problems, most originating from scheduling problems, for which there are polynomial time approximation algorithm...
متن کاملLecture 1: Approximation Algorithms, Approximation Ratios, Gap Problems
To date, thousands of natural optimization problems have been shown to be NP-hard [6, 13]. Designing approximation algorithms [4, 17, 21] has become a standard path to attack these problems. For some problem, however, it is even NP-hard to approximate the optimal solution to within a certain ratio. The TRAVELING SALESMAN PROBLEM (TSP), for instance, has no approximation algorithm, since finding...
متن کاملMAT 585: Max-Cut and Stochastic Block Model
Today we discuss two NP-hard problems, Max-Cut and minimum bisection. As these problems are NP-hard, unless the widely believed P 6= NP conjecture is false, these problem cannot be solved in polynomial time for every instance. These leaves us with a couple of alternatives: either we look for algorithms that approximate the solution, or consider algorithms that work for “typical” instances, but ...
متن کاملA Note on MAX-Ek-LIN2 and the Unique Games
Most combinatorial optimization problems are NP-hard, i.e. they cannot be solved in polynomial time unless P = NP. Two typical approaches to deal with these problems are either to devise approximation algorithms with good performance, or to prove that such algorithms cannot exist. In 2002 S. Khot stated the Unique Games Conjecture (UGC), which generalizes the PCP Theorem. The UGC would imply si...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1605.04679 شماره
صفحات -
تاریخ انتشار 2016