Greedy domination on biclique-free graphs

06/07/2018

∙

by   Sebastian Siebertz, et al.

∙

0

∙

share

The greedy algorithm for approximating dominating sets is a simple method that is known to compute an ( n+1)-approximation of a minimum dominating set on any graph with n vertices. We show that a small modification of the greedy algorithm can be used to compute an O(t^2· k)-approximation, where k is the size of a minimum dominating set, on graphs that exclude the complete bipartite graph K_t,t as a subgraph. We show that on classes of bounded expansion another small modification leads to a constant factor approximation.