Performance analysis of greedy algorithms for Max-IS and Min-Maxl-Match

MaRDI QIDQ1002430zbMATH OpenFDO

Authors Le Cong Thanh

Publication date 26 February 2009

Published in Vietnam Journal of Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 1405697
• The greedier the better: an efficient algorithm for approximating maximum independent set
• Greedy approximations of independent sets in low degree graphs
• scientific article; zbMATH DE number 1003244
• Greedy matching: guarantees and limitations

Cited in

(1)

• Computing and Combinatorics

This page was built for publication: Performance analysis of greedy algorithms for Max-IS and Min-Maxl-Match

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