Performance analysis of greedy algorithms for Max-IS and Min-Maxl-Match
From MaRDI portal
Publication:1002430
zbMath1175.68190MaRDI QIDQ1002430
Publication date: 26 February 2009
Published in: Vietnam Journal of Mathematics (Search for Journal in Brave)
Analysis of algorithms (68W40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
This page was built for publication: Performance analysis of greedy algorithms for Max-IS and Min-Maxl-Match