The greedier the better: an efficient algorithm for approximating maximum independent set

DOI10.1023/A:1011672624624zbMath1135.90425OpenAlexW3163150419MaRDI QIDQ5952051

H. Y. Lau, Hing-Fung Ting

Publication date: 8 January 2002

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011672624624

zbMATH Keywords

combinatorial optimizationapproximationgreedy algorithmsmaximum independent set

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

This page was built for publication: The greedier the better: an efficient algorithm for approximating maximum independent set