Distributed almost exact approximations for minor-closed families

被引:0
|
作者
Czygrinow, Andrzej [1 ]
Hanckowiak, Michal
机构
[1] Arizona State Univ, Dept Math & Stat, Tempe, AZ 85287 USA
[2] Adam Mickiewicz Univ, Fac Math & Comp Sci, Poznan, Poland
来源
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We give efficient deterministic distributed algorithms which given a graph G from a proper minor-closed family C find an approximation of a minimum dominating set in G and a minimum connected dominating set in G. The algorithms are deterministic and run in a polylogarithmic number of rounds. The approximation accomplished differs from an optimal by a multiplicative factor of (1 + o(1)).
引用
收藏
页码:244 / 255
页数:12
相关论文
共 50 条
  • [1] Distributed approximation algorithms for weighted problems in minor-closed families
    Czygrinow, A.
    Hanckowiak, M.
    [J]. COMPUTING AND COMBINATORICS, PROCEEDINGS, 2007, 4598 : 515 - +
  • [2] Densities of Minor-Closed Graph Families
    Eppstein, David
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2010, 17 (01):
  • [3] Proper minor-closed families are small
    Norine, Serguei
    Seymour, Paul
    Thomas, Robin
    Wollan, Paul
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2006, 96 (05) : 754 - 757
  • [4] Diameter and Treewidth in Minor-Closed Graph Families
    D. Eppstein
    [J]. Algorithmica, 2000, 27 : 275 - 291
  • [5] Phase transition of degeneracy in minor-closed families
    Liu, Chun -Hung
    Wei, Fan
    [J]. ADVANCES IN APPLIED MATHEMATICS, 2023, 146
  • [6] Diameter and treewidth in minor-closed graph families
    Eppstein, D
    [J]. ALGORITHMICA, 2000, 27 (3-4) : 275 - 291
  • [7] CHROMATIC ROOTS AND MINOR-CLOSED FAMILIES OF GRAPHS
    Perrett, Thomas
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2016, 30 (03) : 1883 - 1897
  • [8] Diameter and treewidth in minor-closed graph families, revisited
    Demaine, ED
    Hajiaghayi, MT
    [J]. ALGORITHMICA, 2004, 40 (03) : 211 - 215
  • [9] Density of Chromatic Roots in Minor-Closed Graph Families
    Perrett, Thomas J.
    Thomassen, Carsten
    [J]. COMBINATORICS PROBABILITY & COMPUTING, 2018, 27 (06): : 988 - 998
  • [10] Packing minor-closed families of graphs into complete graphs
    Messuti, Silvia
    Rodl, Vojtech
    Schacht, Mathias
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2016, 119 : 245 - 265