On some optimization problems for star-free graphs
<|reference_start|>On some optimization problems for star-free graphs: 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.<|reference_end|>
@article{naidenko2001on,
    title={On some optimization problems for star-free graphs},
    author={V.G. Naidenko, Yu.L. Orlovich},
    journal={arXiv preprint arXiv:cs/0106048},
    year={2001},
    archivePrefix={arXiv},
    eprint={cs/0106048},
    primaryClass={cs.CC cs.DM}
}