Distributed approximation algorithms for weighted problems in minor-closed families

Andrzej Czygrinow; M. Hańćkowiak

doi:10.1007/978-3-540-73545-8_50

Distributed approximation algorithms for weighted problems in minor-closed families

Andrzej Czygrinow, M. Hańćkowiak

Mathematical and Statistical Sciences, School of (SoMSS)

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	Computing and Combinatorics - 13th Annual International Conference, COCOON 2007, Proceedings
Publisher	Springer Verlag
Pages	515-525
Number of pages	11
ISBN (Print)	9783540735441
DOIs	https://doi.org/10.1007/978-3-540-73545-8_50
State	Published - 2007
Event	13th Annual International Computing and Combinatorics Conference, COCOON 2007 - Banff, Canada Duration: Jul 16 2007 → Jul 19 2007

Publication series

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

Other

Other	13th Annual International Computing and Combinatorics Conference, COCOON 2007
Country/Territory	Canada
City	Banff
Period	7/16/07 → 7/19/07

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-540-73545-8_50

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). Springer Verlag. https://doi.org/10.1007/978-3-540-73545-8_50

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4598 LNCS, Springer Verlag, pp. 515-525, 13th Annual International Computing and Combinatorics Conference, COCOON 2007, Banff, Canada, 7/16/07. https://doi.org/10.1007/978-3-540-73545-8_50

Czygrinow A, Hańćkowiak M. Distributed approximation algorithms for weighted problems in minor-closed families. In Computing and Combinatorics - 13th Annual International Conference, COCOON 2007, Proceedings. Springer Verlag. 2007. p. 515-525. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-73545-8_50

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

@inproceedings{7d1886575c8c4f309e7eb6f36c770a7a,

title = "Distributed approximation algorithms for weighted problems in minor-closed families",

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.",

author = "Andrzej Czygrinow and M. Ha{\'n}{\'c}kowiak",

year = "2007",

doi = "10.1007/978-3-540-73545-8_50",

language = "English (US)",

isbn = "9783540735441",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "515--525",

booktitle = "Computing and Combinatorics - 13th Annual International Conference, COCOON 2007, Proceedings",

note = "13th Annual International Computing and Combinatorics Conference, COCOON 2007 ; Conference date: 16-07-2007 Through 19-07-2007",

}

TY - GEN

T1 - Distributed approximation algorithms for weighted problems in minor-closed families

AU - Czygrinow, Andrzej

AU - Hańćkowiak, M.

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=37849012346&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=37849012346&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-73545-8_50

DO - 10.1007/978-3-540-73545-8_50

M3 - Conference contribution

AN - SCOPUS:37849012346

SN - 9783540735441

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 515

EP - 525

BT - Computing and Combinatorics - 13th Annual International Conference, COCOON 2007, Proceedings

PB - Springer Verlag

T2 - 13th Annual International Computing and Combinatorics Conference, COCOON 2007

Y2 - 16 July 2007 through 19 July 2007

ER -

Distributed approximation algorithms for weighted problems in minor-closed families

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this