A parallel algorithm for the minimum weighted vertex cover problem
References (10)
Approximation algorithms for combinatorial problems
J. Comput. System Sci.
(1974)- et al.
Réseaux neuronaux
(1991) - et al.
Computers and Intractability. A Guide to the Theory of NP-Completeness
(1979) Neural networks and physical systems with emergent collective computational abilities
- et al.
Neural computation of decisions in optimization problems
Biological Cybernetics
(1985)
There are more references available in the full text version of this article.
Cited by (7)
A localized distributed algorithm for vertex cover problem
2022, Journal of Computational ScienceCitation Excerpt :In the existing central and parallel solutions for the minimum vertex cover, it is assumed that a single node has the entire graph of the network. Reducing to the network flow problem [7,8], reducing to the maximal matching problem [9], using game theory strategies [10], greedy algorithms [7,11], branch and reduce methods [12], vertex folding [13], temporal paths [14], integer programming [15], parallel computing [9,16], and evolutionary algorithms [17–19] are some of the proposed central methods for the vertex cover problem. However, applying a central algorithm on a distributed system imposes a large amount of message passing to the system because all nodes should send their neighbor list (over multi-hop links) to a single node.
Exact solutions to generalized vertex covering problems: a comparison of two models
2015, Optimization LettersAn effective algorithm for minimum weighted vertex cover problem
2010, International Journal of Computational and Mathematical SciencesAn effective algorithm for minimum weighted vertex cover problem
2010, World Academy of Science, Engineering and TechnologyA Meta-heuristic algorithm for vertex covering problem based on gravity
2009, World Academy of Science, Engineering and TechnologyA meta-heuristic algorithm for vertex covering problem based on gravity
2009, International Journal of Computational and Mathematical Sciences
Copyright © 1995 Published by Elsevier B.V.