# Distributed algorithms for weighted problems in sparse graphs

Andrzej Czygrinow, M. Hańćkowiak

Research output: Contribution to journalArticle

6 Citations (Scopus)

### Abstract

We study distributed algorithms for three graph-theoretic problems in weighted trees and weighted planar graphs. For trees, we present an efficient deterministic distributed algorithm which finds an almost exact approximation of a maximum-weight matching. In addition, in the case of trees, we show how to approximately solve the minimum-weight dominating set problem. For planar graphs, we present an almost exact approximation for the maximum-weight independent set problem.

Original language English (US) 588-607 20 Journal of Discrete Algorithms 4 4 https://doi.org/10.1016/j.jda.2005.07.006 Published - Dec 2006

### Fingerprint

Sparse Graphs
Distributed Algorithms
Parallel algorithms
Planar graph
Deterministic Algorithm
Dominating Set
Weighted Graph
Approximation
Independent Set
Graph in graph theory

### Keywords

• Approximation algorithms
• Distributed algorithms
• Maximum-weight matching
• Minimum-weight dominating set
• Minimum-weight independent set

### ASJC Scopus subject areas

• Computational Theory and Mathematics
• Discrete Mathematics and Combinatorics
• Theoretical Computer Science

### Cite this

In: Journal of Discrete Algorithms, Vol. 4, No. 4, 12.2006, p. 588-607.

Research output: Contribution to journalArticle

@article{f82b1c5396af4f3eac44ed12c7b8249b,
title = "Distributed algorithms for weighted problems in sparse graphs",
abstract = "We study distributed algorithms for three graph-theoretic problems in weighted trees and weighted planar graphs. For trees, we present an efficient deterministic distributed algorithm which finds an almost exact approximation of a maximum-weight matching. In addition, in the case of trees, we show how to approximately solve the minimum-weight dominating set problem. For planar graphs, we present an almost exact approximation for the maximum-weight independent set problem.",
keywords = "Approximation algorithms, Distributed algorithms, Maximum-weight matching, Minimum-weight dominating set, Minimum-weight independent set",
author = "Andrzej Czygrinow and M. Hańćkowiak",
year = "2006",
month = "12",
doi = "10.1016/j.jda.2005.07.006",
language = "English (US)",
volume = "4",
pages = "588--607",
journal = "Journal of Discrete Algorithms",
issn = "1570-8667",
publisher = "Elsevier",
number = "4",

}

TY - JOUR

T1 - Distributed algorithms for weighted problems in sparse graphs

AU - Czygrinow, Andrzej

AU - Hańćkowiak, M.

PY - 2006/12

Y1 - 2006/12

N2 - We study distributed algorithms for three graph-theoretic problems in weighted trees and weighted planar graphs. For trees, we present an efficient deterministic distributed algorithm which finds an almost exact approximation of a maximum-weight matching. In addition, in the case of trees, we show how to approximately solve the minimum-weight dominating set problem. For planar graphs, we present an almost exact approximation for the maximum-weight independent set problem.

AB - We study distributed algorithms for three graph-theoretic problems in weighted trees and weighted planar graphs. For trees, we present an efficient deterministic distributed algorithm which finds an almost exact approximation of a maximum-weight matching. In addition, in the case of trees, we show how to approximately solve the minimum-weight dominating set problem. For planar graphs, we present an almost exact approximation for the maximum-weight independent set problem.

KW - Approximation algorithms

KW - Distributed algorithms

KW - Maximum-weight matching

KW - Minimum-weight dominating set

KW - Minimum-weight independent set

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

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

U2 - 10.1016/j.jda.2005.07.006

DO - 10.1016/j.jda.2005.07.006

M3 - Article

AN - SCOPUS:33750612561

VL - 4

SP - 588

EP - 607

JO - Journal of Discrete Algorithms

JF - Journal of Discrete Algorithms

SN - 1570-8667

IS - 4

ER -