Distributed approximations for packing in unit-disk graphs

被引：0
|
作者：
Czygrinow, Andrzej [1 ]
Hanckowiak, Michal [2 ]
机构：
[1] Arizona State Univ, Dept Math & Stat, Tempe, AZ 85287 USA
[2] Adam Mickiewicz Univ, Fac Math & Comp Sci, Poznan, Poland
来源：
DISTRIBUTED COMPUTING, PROCEEDINGS | 2007年 / 4731卷
关键词：
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
We give a distributed approximation algorithm for the vertexpacking 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.
引用
收藏
页码：152 / +
页数：2
相关论文
共 50 条
  • [21] Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs
    Fedor V. Fomin
    Daniel Lokshtanov
    Fahad Panolan
    Saket Saurabh
    Meirav Zehavi
    Discrete & Computational Geometry, 2019, 62 : 879 - 911
  • [22] Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs
    Fomin, Fedor V.
    Lokshtanov, Daniel
    Panolan, Fahad
    Saurabh, Saket
    Zehavi, Meirav
    DISCRETE & COMPUTATIONAL GEOMETRY, 2019, 62 (04) : 879 - 911
  • [23] Distributed Connected Dominating Sets in Unit Square and Disk Graphs
    Gorain, Barun
    Mondal, Kaushik
    Pandit, Supantha
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2022, 2022, 13571 : 346 - 358
  • [24] Distributed construction of connected dominating set in unit disk graphs
    Jallu, Ramesh K.
    Prasad, Prajwal R.
    Das, Gautam K.
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2017, 104 : 159 - 166
  • [25] On the line-separable unit-disk coverage and related problems
    Liu, Gang
    Wang, Haitao
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2024, 123
  • [26] PACKING CIRCLE IN A UNIT DISK
    HORN, RA
    AMERICAN MATHEMATICAL MONTHLY, 1968, 75 (08): : 913 - &
  • [27] UNIT DISK GRAPHS
    CLARK, BN
    COLBOURN, CJ
    JOHNSON, DS
    DISCRETE MATHEMATICS, 1990, 86 (1-3) : 165 - 177
  • [28] A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
    Funke, Stefan
    Kesselman, Alexander
    Meyer, Ulrich
    Segal, Michael
    ACM TRANSACTIONS ON SENSOR NETWORKS, 2006, 2 (03) : 444 - 453
  • [29] A simple improved distributed algorithm for minimum CDS in unit disk graphs
    Funke, S
    Kesselman, A
    Meyer, U
    Segal, M
    WiMob'2005: IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, Vol 2, Proceedings: MOBILE NETWORKING, 2005, : 220 - 223
  • [30] Distributed Packing in Planar Graphs
    Czygrinow, Andrzej
    Hanckowiak, Michal
    Wawrzyniak, Wojciech
    SPAA'08: PROCEEDINGS OF THE TWENTIETH ANNUAL SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2008, : 55 - +
12345