A note on greedy algorithms for the maximum weighted independent set problem
Top Cited Papers
- 15 March 2003
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 126 (2-3) , 313-322
- https://doi.org/10.1016/s0166-218x(02)00205-6
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Greed is good: Approximating independent sets in sparse and bounded-degree graphsAlgorithmica, 1997
- A Probabilistic lower bound on the independence number of graphsDiscrete Mathematics, 1994
- The maximum clique problemJournal of Global Optimization, 1994
- Stable sets and polynomialsDiscrete Mathematics, 1994
- Small transversals in hypergraphsCombinatorica, 1992
- Lower bounds on the independence number in terms of the degreesJournal of Combinatorial Theory, Series B, 1983