On approximation properties of the independent set problem for degree 3 graphs

被引：0
|
作者：
Berman, P [1 ]
Fujito, T [1 ]
机构：
[1] HIROSHIMA UNIV, DEPT ELECT ENGN, HIGASHIHIROSHIMA 739, JAPAN
来源：
ALGORITHMS AND DATA STRUCTURES | 1995年 / 955卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The main problem we consider in this paper is the Independent Set problem for bounded degree graphs. It is shown that the problem remains MAX SNP-complete when the maximum degree is bounded by 3. Some related problems are also shown to be MAX SNP-complete at the lowest possible degree bounds. Next we study better poly-time approximation of the problem for degree 3 graphs, and improve the previously best ratio, 5/4, to arbitrarily close to 5/6. This result also provides improved poly-time approximation ratios, B+3/5 + epsilon, for odd degree B.
引用
收藏
页码：449 / 460
页数：12
相关论文
共 50 条
12345