In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
Kai Xing, Wei Cheng, E. K. Park, Shmuel Rotenstrei...
Abstract— In this paper we use an information-theoretic formulation for characterizing the minimum routing overhead of link state routing in a mobile ad hoc network. We formulate...
— This paper considers the problem of finding the path with minimum (zero) worst possible number of errors in a network with V nodes where (1) some nodes are capable of correcti...
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
Abstract. The reliability problem of the quickest path deals with the transmission of a message of sizeσ from a source to a destination with both the minimum end-to-end delay and ...