## Abstract

In this paper we will give two distributed approximation algorithms (in the Local model) for the minimum dominating set problem. First we will give a distributed algorithm which finds a dominating set D of size O(γ(G)) in a graph G which has no topological copy of K_{h}. The algorithm runs L_{h} rounds where L_{h} is a constant which depends on h only. This procedure can be used to obtain a distributed algorithm which given > 0 finds in a graph G with no K_{h}-minor a dominating set D of size at most (1 + )γ(G). The second algorithm runs in O(log^{∗} |V (G)|) rounds.

Original language | English (US) |
---|---|

Title of host publication | 29th International Symposium on Algorithms and Computation, ISAAC 2018 |

Editors | Wen-Lian Hsu, Der-Tsai Lee, Chung-Shou Liao |

Publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |

Pages | 22:1–22:12 |

ISBN (Electronic) | 9783959770941 |

DOIs | |

State | Published - Dec 1 2018 |

Event | 29th International Symposium on Algorithms and Computation, ISAAC 2018 - Jiaoxi, Yilan, Taiwan, Province of China Duration: Dec 16 2018 → Dec 19 2018 |

### Publication series

Name | Leibniz International Proceedings in Informatics, LIPIcs |
---|---|

Volume | 123 |

ISSN (Print) | 1868-8969 |

### Conference

Conference | 29th International Symposium on Algorithms and Computation, ISAAC 2018 |
---|---|

Country/Territory | Taiwan, Province of China |

City | Jiaoxi, Yilan |

Period | 12/16/18 → 12/19/18 |

## Keywords

- Distributed algorithms
- MDS
- Minor-closed family of graphs

## ASJC Scopus subject areas

- Software

## Fingerprint

Dive into the research topics of 'Distributed approximation algorithms for the minimum dominating set in K_{H}-minor-free graphs'. Together they form a unique fingerprint.