scientific article; zbMATH DE number 8779

MaRDI QIDQ3971267zbMATH OpenFDO

Authors Andrzej Lingas

Publication date 25 June 1992

zbMATH Keywords

EREW PRAMgreedy heuristicminimum vertex coverCRCW PRAM

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A parallel algorithm for the minimum weighted vertex cover problem
• scientific article; zbMATH DE number 1263280
• scientific article; zbMATH DE number 19175
• scientific article; zbMATH DE number 1953099

Cited in

(7)

• A 2-approximation NC algorithm for connected vertex cover and tree cover
• An experimental comparison of three heuristics for the WVCP
• Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP
• Solving NP-hard problems in 'almost trees': vertex cover
• Parallel and serial heuristics for the minimum set cover problem
• A parallel circle-cover minimization algorithm
• scientific article; zbMATH DE number 1953099 (Why is no real title available?)

This page was built for publication:

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