On some optimization problems for star-free graphs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
6 pages, in Russian

Keywords

Computational Complexity, Discrete Mathematics, G.1.2; G.2.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/30664

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0106048
 http://arxiv.org/abs/cs/0106048

Collections

arXiv