Distributed approximations for packing in unit-disk graphs

Andrzej Czygrinow, Michal Hańćkowiak

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations


We give a distributed approximation algorithm for the vertex-packing problem in unit-disk graphs. Given a graph H, the algorithm finds in a unit-disk graph G a collection of pairwise disjoint copies of H of size which is approximately equal to the packing number of H in G. The algorithm is deterministic and runs in a poly-logarithmic number of rounds in the message passing model.

Original languageEnglish (US)
Title of host publicationDistributed Computing - 21st International Symposium, DISC 2007, Proceedings
PublisherSpringer Verlag
Number of pages13
ISBN (Print)9783540751410
StatePublished - 2007
Event21st International Symposium on Distributed Computing, DISC 2007 - Lemesos, Cyprus
Duration: Sep 24 2007Sep 26 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4731 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other21st International Symposium on Distributed Computing, DISC 2007

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Distributed approximations for packing in unit-disk graphs'. Together they form a unique fingerprint.

Cite this