Highly Influenced

# It is Hard to Know when Greedy is Good for Finding Independent Sets

@article{Bodlaender1997ItIH, title={It is Hard to Know when Greedy is Good for Finding Independent Sets}, author={Hans L. Bodlaender and Dimitrios M. Thilikos and Koichi Yamazaki}, journal={Inf. Process. Lett.}, year={1997}, volume={61}, pages={101-111} }

- Published 1997 in Inf. Process. Lett.
DOI:10.1016/S0020-0190(96)00208-6

The classes Ar and Sr are de ned as the classes of those graphs, where the minimum degree greedy algorithm always approximates the maximum independent set (MIS) problem within a factor of r, respectively, where this algorithm has a sequence of choices that yield an output that is at most a factor r from optimal, r 1 a rational number. It is shown that deciding whether a given graph belongs to Ar is coNP-complete for any xed r 1, and deciding whether a given graph belongs to S1 is DP-hard, and… CONTINUE READING

#### From This Paper

##### Topics from this paper.

#### Citations

##### Publications citing this paper.

#### References

##### Publications referenced by this paper.

Showing 1-8 of 8 references