A parallel algorithm for the minimum weighted vertex cover problem

DOI10.1016/0020-0190(94)00189-6MaRDI QIDQ674187zbMATH OpenOpenAlexFDO

Authors Aristidis Likas, Andreas 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

zbMATH Keywords

OptimizationHeuristicsParallel algorithmsVertex covering

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 1263280
• scientific article; zbMATH DE number 8779
• An approximation algorithm for the minimum weighted vertex-cover problem
• A natural model and a parallel algorithm for approximately solving the maximum weighted independent set problem

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• 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
• ``Neural computation of decisions in optimization problems

Cited in

(3)

• Exact solutions to generalized vertex covering problems: a comparison of two models
• A natural model and a parallel algorithm for approximately solving the maximum weighted independent set problem
• A parallel circle-cover minimization algorithm

This page was built for publication: A parallel algorithm for the minimum weighted vertex cover problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674187)