Approximation algorithms for dominating set problem I am working on approximation algorithms for minimum dominating set problem. In particular, I am interested in graphs classes restricted by forbidden induced subgraphs.
Since the domination problem and its variants have been extensively studied, I suppose someone may worked on this before.
So, the question is: 

Does someone knows papers where it is studied approximation algorithms for domination problem for graphs classes defined by forbidden induced subgraphs?

Thanks in advance.
Kind regards.
The class of line graphs can be characterized by a finite family of forbidden induced subgraphs (Beineke).  A dominating set in a line graph G corresponds to an edge dominating set of the root graph of G (and vice versa), and the size of minimum edge dominating set can be approximated by factor of 2 in polynomial time.


http://en.wikipedia.org/wiki/Line_graph
http://en.wikipedia.org/wiki/Edge_dominating_set