A parallel algorithm for the minimum weighted vertex cover problem
From MaRDI portal
Publication:674187
DOI10.1016/0020-0190(94)00189-6zbMath0875.68497OpenAlexW2125170150MaRDI QIDQ674187
Aristidis Likas, Andreas N. Stafylopatis
Publication date: 28 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(94)00189-6
Related Items (2)
A natural model and a parallel algorithm for approximately solving the maximum weighted independent set problem ⋮ Exact solutions to generalized vertex covering problems: a comparison of two models
Cites Work
- Unnamed Item
- ``Neural computation of decisions in optimization problems
- Approximation algorithms for combinatorial problems
- Neural networks and physical systems with emergent collective computational abilities.
- On the approximation of NP-complete problems by using the Boltzmann machine method: the cases of some covering and packing problems
This page was built for publication: A parallel algorithm for the minimum weighted vertex cover problem
