Distributed algorithms for weighted problems in sparse graphs
نویسندگان
چکیده
منابع مشابه
Distributed algorithms for weighted problems in sparse graphs
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 presen...
متن کاملDistributed Approximation Algorithms for Weighted Problems in Minor-Closed Families
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.
متن کاملDistributed algorithms for weighted problems in minor-closed families
We give efficient distributed 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 argue that no efficient distributed algorithm for the minimum weight connected dominating set exists.
متن کاملAlgorithms for alpha-rate domination problems on weighted graphs
In this article, we investigate a domination set problem variant on vertex-weighted graphs. In the last few years, several algorithms have been presented for solving the minimum alpha and alpha-rate domination problem (also known as the positive influence dominating sets problem) on simple graphs. We recently proposed an algorithm for alpha-rate domination on weighted graphs based on randomised...
متن کاملDistributed Algorithms for Sparse Reconstruction
Many applications require the knowledge of a sparse linear combination of elementary signals that can explain a given signal. This problem is known as “sparse approximation problem” and arises in many fields of electrical engineering and applied mathematics. The great difficulty when dealing with sparse approximation problems is the lack of convexity or the non-differentiability inherent to the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2006
ISSN: 1570-8667
DOI: 10.1016/j.jda.2005.07.006