Greedy Algorithms for Minimisation Problems in Random Regular Graphs

In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the minimum vertex cover (MVC), minimum independent dominating set (MIDS) and minimum edge dominating set (MEDS) problems. In almost all cases we are able to improve the best known results for these problems. Results for the MVC problem translate immediately to results for the maximum independent set problem. We also derive lower bounds on the size of an optimal MIDS.

• Type: Conference
• Year: 2001
• Where: ESA
• Authors: Michele Zito
• Keywords: Algorithms, EDGE DOMINATING SET, ESA 2001, Minimum Independent Dominating Set, Minimum Vertex Cover