A new 3/2-approximation algorithm for the b-\textsc{Edge Cover} problem

DOI10.1137/1.9781611974690.CH6MaRDI QIDQ6539147zbMATH OpenFDO

Authors A. Khan, Alex Pothen

Publication date 14 May 2024

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• New approximation algorithms for minimum weighted edge cover
• Efficient approximation algorithms for weighted \(b\)-matching
• Computing and Combinatorics
• On matchings and \(b\)-edge dominating sets: a 2-approximation algorithm for the 3-edge dominating set problem
• Algorithms and Data Structures

Cited in

(1)

• New approximation algorithms for minimum weighted edge cover

This page was built for publication: A new 3/2-approximation algorithm for the \(b\)-\textsc{Edge Cover} problem

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