Distributed approximation algorithms for weighted problems in minor-closed families

被引：0
|
作者：
Czygrinow, A. [1 ]
Hanckowiak, M. [2 ]
机构：
[1] Arizona State Univ, Dept Math & Stat, Tempe, AZ 85287 USA
[2] Adam Mickiewicz Univ, Fac Math & Comp Sci, Poznan, Poland
来源：
COMPUTING AND COMBINATORICS, PROCEEDINGS | 2007年 / 4598卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed families. To complement these results we indicate that no efficient distributed algorithm for the minimum weight connected dominating set exists.
引用
收藏
页码：515 / +
页数：2
相关论文
共 50 条
  • [1] Distributed almost exact approximations for minor-closed families
    Czygrinow, Andrzej
    Hanckowiak, Michal
    [J]. ALGORITHMS - ESA 2006, PROCEEDINGS, 2006, 4168 : 244 - 255
  • [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] Node-weighted Network Design in Planar and Minor-closed Families of Graphs
    Chekuri, Chandra
    Ene, Alina
    Vakilian, Ali
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2021, 17 (02)
  • [5] Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs
    Chekuri, Chandra
    Ene, Alina
    Vakilian, Ali
    [J]. AUTOMATA, LANGUAGES, AND PROGRAMMING, ICALP 2012 PT I, 2012, 7391 : 206 - 217
  • [6] Diameter and Treewidth in Minor-Closed Graph Families
    D. Eppstein
    [J]. Algorithmica, 2000, 27 : 275 - 291
  • [7] Phase transition of degeneracy in minor-closed families
    Liu, Chun -Hung
    Wei, Fan
    [J]. ADVANCES IN APPLIED MATHEMATICS, 2023, 146
  • [8] Additive Approximation Algorithms for List-Coloring Minor-Closed Class of Graphs
    Kawarabayashi, Ken-ichi
    Demaine, Erik D.
    Hajiaghayi, MohammadTaghi
    [J]. PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 1166 - +
  • [9] Diameter and treewidth in minor-closed graph families
    Eppstein, D
    [J]. ALGORITHMICA, 2000, 27 (3-4) : 275 - 291
  • [10] CHROMATIC ROOTS AND MINOR-CLOSED FAMILIES OF GRAPHS
    Perrett, Thomas
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2016, 30 (03) : 1883 - 1897
12345