Distributed algorithms for weighted problems in sparse graphs
type: Item
instance of: scholarly article
title: Distributed algorithms for weighted problems in sparse graphs
zbMATH Open document ID: 1109.68132
published in: Journal of Discrete Algorithms
publication date: 2007-02-14T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5126390
zbMATH Keywords: distributed algorithms
zbMATH Keywords: approximation algorithms
zbMATH Keywords: maximum-weight matching
zbMATH Keywords: minimum-weight dominating set
zbMATH Keywords: minimum-weight independent set
author: Andrzej Czygrinow
author: Michal Hanckowiak
MaRDI profile type: Publication
full work available at URL: j.jda.2005.07.006
OpenAlex ID: W1979561519
cites work: Deterministic coin tossing with applications to optimal parallel list ranking
cites work: Distributed Algorithm for Better Approximation of the Maximum Matching
cites work: Distributed algorithm for approximating the maximum matching
cites work: Algorithms – ESA 2004
cites work: An efficient distributed algorithm for constructing small dominating sets
cites work: Constant-time distributed dominating set approximation
cites work: Fast distributed construction of k-dominating sets and applications
cites work: Locality in Distributed Graph Algorithms
cites work: Distributed Weighted Matching
DOI: 10.1016/J.JDA.2005.07.006
description: scientific article; zbMATH DE number 5126390