Paschos, The probabilistic minimum vertex covering problem, manuscript, LAMSADE, UniversiteA Paris-Dauphine, Paris, France.Murat, C., Paschos, V.T.: The probabilistic minimum vertex-covering problem. Int. Trans. Opl. Res. 9, 19–32 (2002) MATH MathSciNet...
Vertex covering problemOptimizationApproximation algorithmThis paper is aimed to present the solution to vertex cover problem by means of an approximation solution. As it is NP complete problem, we can have an approximate time algorithm to solve the vertex cover problem. We will modify the algorithm...
3.This paper mainly studies two variants of thevertex coveringproblem.本文主要研究了顶点覆盖问题的两个变体问题:一个是连接的顶点覆盖问题,二是含权的树型顶点覆盖问题。
Important generalizations of the Vertex Cover problem ( Connected Vertex Cover , Capacitated Vertex Cover , and Maximum Partial Vertex Cover ) have been intensively studied in terms of approximability. However, their parameterized complexity has so far been completely open. We close this gap here ...
这个问题有一个npo(np optimization problem)的变种,即:找到满足条件的最小顶点集,也就是使得满足条件下最小|V'|值。 首先可以看出,这是两类完全不同的问题,set cover属于集合一类问题,应用于计算机科学以及计算理论方面。vertex cover,属于图论一类问题,应用于计算机科学、计算理论、图论、数学等等方面。
scientists.This paper mainly studies two variants of the vertex covering problem.One is the connected vertex covering problem and the other is the weighted tree covering problem.The paper gives the fixed parameter tractable algorithm for these problems,respectively,and it is the best results for the...
applied to various combinatorial optimization problems, including the maximum satisfiability problem [5], minimum weighted vertex cover problem [10], vertex separator problem [3], graph coloring problem [28], maximum weight clique problem [19], minimum set covering problem [21], and many others. ...
We call this the m -secure vertex cover problem, where m stands for the multiple guard movements. The minimum number of guards required to defend the edges of G against a single attack using multiple guard movements is called the m - secure vertex covering number and it is denoted by 伪 ...
The problem of finding approximate solutions for a subclass of multicovering problems denoted by ILP(k, b) is considered. The problem involves finding x ... D Peleg,G Schechtman,A Wool - 《Algorithmica》 被引量: 41发表: 1997年 Lift & Project Systems Performing on the Partial-Vertex-Cover ...
In this article, we present an implementation of a distributed branch and bound algorithm solving the Vertex Cover problem on a network of up to 63 Transputers. We implemented two different strategies: The first parallelization of our branch and bound al