Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

WG

2005

Springer

2005

Springer

In unweighted case, approximation ratio for the independent set problem has been analyzed in terms of the graph parameters, such as the number of vertices, maximum degree, and average degree. In weighted case, no corresponding results are given for average degree. It is not appropriate that we analyze weighted independent set algorithms in terms of average degree, since inserting the vertices with small weight decreases average degree arbitrarily without signiﬁcantly changing approximation ratio. In this paper, we introduce the “weighted” average degree and “weighted” inductiveness, and analyze algorithms for the weighted independent set problem in terms of these parameters.

Related Content

Added |
28 Jun 2010 |

Updated |
28 Jun 2010 |

Type |
Conference |

Year |
2005 |

Where |
WG |

Authors |
Akihisa Kako, Takao Ono, Tomio Hirata, Magnús M. Halldórsson |

Comments (0)