APPML
2010
14 years 17 days ago
2010
We prove that for every tree T of order at least 2 and every minimum dominating set D of T which contains at most one endvertex of T, there is an independent dominating set I of T...
HICSS
2008
IEEE
14 years 18 days ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
COLOGNETWENTE
2007
14 years 1 months ago
2007
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
CCCG
2010
14 years 1 months ago
2010
A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...
FSTTCS
2000
Springer
14 years 4 months ago
2000
Springer
Abstract. We describe some new, simple and apparently general methods for designing FPT algorithms, and illustrate how these can be used to obtain a signi cantly improved FPT algor...
INFOCOM
2000
IEEE
14 years 4 months ago
2000
IEEE
— An ad hoc network may be logically represented as a set of clusters. The clusterheads form a -hop dominating set. Each node is at most hops from a clusterhead. Clusterheads for...
ISPAN
2002
IEEE
14 years 5 months ago
2002
IEEE
Routing based on a connected dominating set is a promising approach, where the search space for a route is reduced to the hosts in the set. A set is dominating if all the hosts in...
MFCS
2004
Springer
14 years 5 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
ESA
2004
Springer
14 years 5 months ago
2004
Springer
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...
IPPS
2005
IEEE
14 years 6 months ago
2005
IEEE
We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task und...