Computer Science – Computational Complexity
Scientific paper
2001-06-25
Computer Science
Computational Complexity
6 pages, in Russian
Scientific paper
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.
Naidenko V. G.
Orlovich Yu. L.
No associations
LandOfFree
On some optimization problems for star-free graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On some optimization problems for star-free graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On some optimization problems for star-free graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-193988