### 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 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |

Pages | 385-398 |

Number of pages | 14 |

Volume | 4167 LNCS |

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) | 03029743 |

ISSN (Electronic) | 16113349 |

### Other

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

Country | Sweden |

City | Stockholm |

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

### Fingerprint

### ASJC Scopus subject areas

- Computer Science(all)
- Biochemistry, Genetics and Molecular Biology(all)
- Theoretical Computer Science

### Cite this

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)*(Vol. 4167 LNCS, pp. 385-398). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4167 LNCS).

**Distributed approximation algorithms in unit-disk graphs.** / Czygrinow, Andrzej; Hańćkowiak, M.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).*vol. 4167 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4167 LNCS, pp. 385-398, 20th International Symposium on Distributed Computing, DISC 2006, Stockholm, Sweden, 9/18/06.

}

TY - GEN

T1 - Distributed approximation algorithms in unit-disk graphs

AU - Czygrinow, Andrzej

AU - Hańćkowiak, M.

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33845232593&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33845232593&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:33845232593

SN - 3540446249

SN - 9783540446248

VL - 4167 LNCS

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

SP - 385

EP - 398

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

ER -