### Abstract

We will give distributed approximation schemes for the maximum matching problem and the minimum connected dominating set problem in unit-disk graphs. The algorithms are deterministic, run in a poly-logarithmic number of rounds in the message passing model and the approximation error can be made O(1/log ^{k} |G|) where |G| is the order of the graph and k is a positive integer.

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

Title of host publication | Distributed Computing - 20th International Symposium, DISC 2006, Proceedings |

Publisher | Springer Verlag |

Pages | 385-398 |

Number of pages | 14 |

ISBN (Print) | 3540446249, 9783540446248 |

DOIs | |

State | Published - 2006 |

Event | 20th International Symposium on Distributed Computing, DISC 2006 - Stockholm, Sweden Duration: Sep 18 2006 → Sep 20 2006 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 4167 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 20th International Symposium on Distributed Computing, DISC 2006 |
---|---|

Country | Sweden |

City | Stockholm |

Period | 9/18/06 → 9/20/06 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'Distributed approximation algorithms in unit-disk graphs'. Together they form a unique fingerprint.

## Cite this

Czygrinow, A., & Hańćkowiak, M. (2006). Distributed approximation algorithms in unit-disk graphs. In

*Distributed Computing - 20th International Symposium, DISC 2006, Proceedings*(pp. 385-398). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4167 LNCS). Springer Verlag. https://doi.org/10.1007/11864219_27