Add to ORKGWe 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 com-plement these results we indicate that no efficient distributed algorithm for the minimum weight connected dominating set exists
Finding a small dominating set is one of the most fun-damental problems of traditional graph theory....
Finding a small dominating set is one of the most fundamental problems of traditional graph theory. ...
Finding a small dominating set is one of the most fundamental problems of traditional graph theory. ...
AbstractWe study distributed algorithms for three graph-theoretic problems in weighted trees and wei...
Wattenhofer et al. [WW04] derive a complicated distributed algorithm to compute a weighted matching ...
We study approximation hardness of the MINIMUM DOMINATING SET problem and its variants in undirected...
This paper presents a near-optimal distributed approximation algorithm for the minimum-weight connec...
In this paper, we present fast distributed approximation algorithms for matching in weighted trees a...
We study approximation hardness of the Minimum Dominating Set problem and its variants in undirected...
ABSTRACT Finding a small dominating set is one of the most fundamental problems of traditional graph...
In this paper we will give two distributed approximation algorithms (in the Local model) for the min...
We provide the first interesting explicit lower bounds on efficient approximability for two closely ...
The dominating set problem in graphs asks for a minimumsize subset of vertices with the following pr...
Finding a small dominating set is one of the most fundamental problems of traditional graph theory. ...
Abstract. ± We consider the problem of computing a matching in a large weighted graph using a parall...
Finding a small dominating set is one of the most fun-damental problems of traditional graph theory....
Finding a small dominating set is one of the most fundamental problems of traditional graph theory. ...
Finding a small dominating set is one of the most fundamental problems of traditional graph theory. ...
AbstractWe study distributed algorithms for three graph-theoretic problems in weighted trees and wei...
Wattenhofer et al. [WW04] derive a complicated distributed algorithm to compute a weighted matching ...
We study approximation hardness of the MINIMUM DOMINATING SET problem and its variants in undirected...
This paper presents a near-optimal distributed approximation algorithm for the minimum-weight connec...
In this paper, we present fast distributed approximation algorithms for matching in weighted trees a...
We study approximation hardness of the Minimum Dominating Set problem and its variants in undirected...
ABSTRACT Finding a small dominating set is one of the most fundamental problems of traditional graph...
In this paper we will give two distributed approximation algorithms (in the Local model) for the min...
We provide the first interesting explicit lower bounds on efficient approximability for two closely ...
The dominating set problem in graphs asks for a minimumsize subset of vertices with the following pr...
Finding a small dominating set is one of the most fundamental problems of traditional graph theory. ...
Abstract. ± We consider the problem of computing a matching in a large weighted graph using a parall...
Finding a small dominating set is one of the most fun-damental problems of traditional graph theory....
Finding a small dominating set is one of the most fundamental problems of traditional graph theory. ...
Finding a small dominating set is one of the most fundamental problems of traditional graph theory. ...