scientific article; zbMATH DE number 8779

zbMATH Open0744.68109MaRDI QIDQ3971267FDOQ3971267

Authors: Andrzej Lingas 

Publication date: 25 June 1992

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

EREW PRAMgreedy heuristicminimum vertex coverCRCW PRAM

Mathematics Subject Classification ID

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

Cited In (7)

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

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)