On some optimization problems for star-free graphs
计算复杂性
2007-05-23 v1 离散数学
摘要
It is shown that in star-free graphs the maximum independent set problem, the minimum dominating set problem and the minimum independent dominating set problem are approximable up to constant factor by any maximal independent set.
引用
@article{arxiv.cs/0106048,
title = {On some optimization problems for star-free graphs},
author = {V. G. Naidenko and Yu. L. Orlovich},
journal= {arXiv preprint arXiv:cs/0106048},
year = {2007}
}
备注
6 pages, in Russian