Add to ORKGFinding a small dominating set is one of the most fun-damental problems of traditional graph theory. In this paper, we present a new fully distributed approximation algorithm based on LP relaxation techniques. For an arbitrary parameter k, our algorithm computes a dom-inating set of expected size O k2=k log jDSOPT
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacen...
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorith...
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorith...
ABSTRACT Finding a small dominating set is one of the most fundamental problems of traditional graph...
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. ...
Abstract. Finding a small dominating set is one of the most fundamental problems of classical graph ...
Finding a small dominating set is one of the most fundamental problems of traditional graph theory. ...
Abstract.: Finding a small dominating set is one of the most fundamental problems of classical graph...
This paper presents a near-optimal distributed approximation algorithm for the minimum-weight connec...
We show that there is no deterministic local algorithm (con-stant-time distributed graph algorithm) ...
Abstract. We show that there is no deterministic local algorithm (constant-time distributed graph al...
A problem open for many years is whether there is an FPT algorithm that given a graph G and paramete...
We study approximation hardness of the MINIMUM DOMINATING SET problem and its variants in undirected...
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorith...
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacen...
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorith...
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorith...
ABSTRACT Finding a small dominating set is one of the most fundamental problems of traditional graph...
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. ...
Abstract. Finding a small dominating set is one of the most fundamental problems of classical graph ...
Finding a small dominating set is one of the most fundamental problems of traditional graph theory. ...
Abstract.: Finding a small dominating set is one of the most fundamental problems of classical graph...
This paper presents a near-optimal distributed approximation algorithm for the minimum-weight connec...
We show that there is no deterministic local algorithm (con-stant-time distributed graph algorithm) ...
Abstract. We show that there is no deterministic local algorithm (constant-time distributed graph al...
A problem open for many years is whether there is an FPT algorithm that given a graph G and paramete...
We study approximation hardness of the MINIMUM DOMINATING SET problem and its variants in undirected...
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorith...
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacen...
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorith...
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorith...