@inproceedings{e22f419c005d43dca3d38f99de7d4a8b,
title = "Distributed approximations for packing in unit-disk graphs",
abstract = "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.",
author = "Andrzej Czygrinow and Michal Ha{\'n}{\'c}kowiak",
year = "2007",
doi = "10.1007/978-3-540-75142-7\_14",
language = "English (US)",
isbn = "9783540751410",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "152--164",
booktitle = "Distributed Computing - 21st International Symposium, DISC 2007, Proceedings",
note = "21st International Symposium on Distributed Computing, DISC 2007 ; Conference date: 24-09-2007 Through 26-09-2007",
}