Statistical physics of hard combinatorial optimization: Vertex cover problem
نویسندگان
چکیده
منابع مشابه
Statistical physics of hard combinatorial optimization: The vertex cover problem
Typical-case computation complexity is a research topic at the boundary of computer science, applied mathematics, and statistical physics. In the last twenty years the replica-symmetry-breaking mean field theory of spin glasses and the associated message-passing algorithms have greatly deepened our understanding of typical-case computation complexity. In this paper we use the vertex cover probl...
متن کاملStatistical mechanics of the vertex-cover problem
We review recent progress in the study of the vertex-cover problem (VC). The VC belongs to the class of NP-complete graph theoretical problems, which plays a central role in theoretical computer science. On ensembles of random graphs, VC exhibits a coverable–uncoverable phase transition. Very close to this transition, depending on the solution algorithm, easy–hard transitions in the typical run...
متن کاملStatistical Physics of Hard Optimization Problems
ix Title: Statistical Physics of Hard Optimization Problems Author: Lenka Zdeborová Abstract: Optimization is fundamental in many areas of science, from computer science and information theory to engineering and statistical physics, as well as to biology or social sciences. It typically involves a large number of variables and a cost function depending on these variables. Optimization problems ...
متن کاملOptimization of Unweighted Minimum Vertex Cover
The Minimum Vertex Cover (MVC) problem is a classic graph optimization NP complete problem. In this paper a competent algorithm, called Vertex Support Algorithm (VSA), is designed to find the smallest vertex cover of a graph. The VSA is tested on a large number of random graphs and DIMACS benchmark graphs. Comparative study of this algorithm with the other existing methods has been carried out....
متن کاملOn the max min vertex cover Problem
We address the max min vertex cover problem, which is the maximization version of the well studied min independent dominating set problem, known to be NP-hard and highly inapproximable in polynomial time. We present tight approximation results for this problem on general graphs, namely a polynomial approximation algorithm which guarantees an n approximation ratio, while showing that unless P = ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chinese Physics B
سال: 2014
ISSN: 1674-1056
DOI: 10.1088/1674-1056/23/7/078901