scientific article; zbMATH DE number 2080241

MaRDI QIDQ4472486zbMATH OpenFDO

Authors Jianer Chen, Iyad Kanj

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1969/19690132.htm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• On approximating minimum vertex cover for graphs with perfect matching
• Computing and Combinatorics
• On hard instances of approximate vertex cover
• On the parameterized vertex cover problem for graphs with perfect matching
• New approximation algorithms for the vertex cover problem

Cited in

(6)

• A note on minimal matching covered graphs
• Maintaining a large matching and a small vertex cover
• Computing and Combinatorics
• On approximating minimum vertex cover for graphs with perfect matching
• Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover
• On the parameterized vertex cover problem for graphs with perfect matching

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 Q4472486)