Minimum vertex covering problem based on the shortest path algorithm

DOI10.3969/J.ISSN.1001-4373.2015.04.030MaRDI QIDQ3461753zbMATH OpenFDO

Authors Lei Kou, Xiaochuan Cui, Jingrong Chen

Publication date 15 January 2016

Full work available at URL https://doi.org/10.3969/J.ISSN.1001-4373.2015.04.030

zbMATH Keywords

approximation algorithmDijkstra algorithmminimum vertex covering problemtime complex

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• An approximation algorithm for the minimum weighted vertex-cover problem
• An approximation of the minimum vertex cover in a graph
• scientific article; zbMATH DE number 5631194
• scientific article; zbMATH DE number 19175
• scientific article; zbMATH DE number 6303718

Cited in

(1)

• An approximation algorithm for the minimum weighted vertex-cover problem

This page was built for publication: Minimum vertex covering problem based on the shortest path algorithm

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