Distributed approximation algorithms for weighted problems in minor-closed families

Andrzej Czygrinow, M. Hańćkowiak

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

Abstract

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.

Original languageEnglish (US)
Title of host publicationComputing and Combinatorics - 13th Annual International Conference, COCOON 2007, Proceedings
Pages515-525
Number of pages11
StatePublished - Dec 1 2007
Event13th Annual International Computing and Combinatorics Conference, COCOON 2007 - Banff, Canada
Duration: Jul 16 2007Jul 19 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4598 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other13th Annual International Computing and Combinatorics Conference, COCOON 2007
CountryCanada
CityBanff
Period7/16/077/19/07

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Czygrinow, A., & Hańćkowiak, M. (2007). Distributed approximation algorithms for weighted problems in minor-closed families. In Computing and Combinatorics - 13th Annual International Conference, COCOON 2007, Proceedings (pp. 515-525). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4598 LNCS).