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 条
  • [41] Well-separated pair decomposition for the unit-disk graph metric and its applications
    Gao, J
    Zhang, L
    SIAM JOURNAL ON COMPUTING, 2005, 35 (01) : 151 - 169
  • [42] SIMPLE HEURISTICS FOR UNIT DISK GRAPHS
    MARATHE, MV
    BREU, H
    HUNT, HB
    RAVI, SS
    ROSENKRANTZ, DJ
    NETWORKS, 1995, 25 (02) : 59 - 68
  • [43] Approximation algorithms for unit disk graphs
    van Leeuwen, EJ
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2005, 3787 : 351 - 361
  • [44] Network Localization on Unit Disk Graphs
    Kaewprapha, Phisan
    Li , Jing
    Puttarak, Nattakan
    2011 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE (GLOBECOM 2011), 2011,
  • [45] Hierarchically specified unit disk graphs
    Marathe, MV
    Radhakrishnan, V
    Hunt, HB
    Ravi, SS
    THEORETICAL COMPUTER SCIENCE, 1997, 174 (1-2) : 23 - 65
  • [46] Improper Coloring of Unit Disk Graphs
    Havet, Frederic
    Kang, Ross J.
    Sereni, Jean-Sebastien
    NETWORKS, 2009, 54 (03) : 150 - 164
  • [47] A Fully Distributed Fault-Tolerant Cluster Head Selection Algorithm for Unit Disk Graphs
    Arapoglu, Ozkan
    Dagdeviren, Orhan
    2019 INTERNATIONAL SYMPOSIUM ON NETWORKS, COMPUTERS AND COMMUNICATIONS (ISNCC 2019), 2019,
  • [48] NONUNIQUENESS OF BEST RATIONAL TSCHEBYSCHEV APPROXIMATIONS ON THE UNIT DISK
    GUTKNECHT, MH
    TREFETHEN, LN
    JOURNAL OF APPROXIMATION THEORY, 1983, 39 (03) : 275 - 288
  • [49] The roman domination problem in unit disk graphs
    Shang, Weiping
    Hu, Xiaodong
    COMPUTATIONAL SCIENCE - ICCS 2007, PT 3, PROCEEDINGS, 2007, 4489 : 305 - +
  • [50] Shortest Path Separators in Unit Disk Graphs
    Harb, Elfarouk
    Huang, Zhengcheng
    Zheng, Da Wei
    Leibniz International Proceedings in Informatics, LIPIcs, 308
12345