Let P be a combinatorial optimization problem, and let A be an approximation algorithm for P. The domination ratio domr(A, s) is the maximal real q such that the solution x(I) obt...
In this paper we construct two distributed algorithms for computing approximations of a largest matching and a minimum dominating set in planar graphs on n vertices. The approximat...
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szyman...
Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. In this paper we consider the "average...
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...