In this paper, we study the static path planning problem with wireless sensor network localization as the primary objective. We consider a model in which sensors are assumed to be...
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
User-controlled circuit-switched optical networks are gaining popularity in an effort to fulfill the insatiable data transport needs of the online community. In this paper we cons...
The electrostatic discharge (ESD) problem has become a challenging reliability issue in nanometer circuit design. High voltages resulted from ESD might cause high current densitie...
We study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem work under the assumption that bef...