Localization of sensor nodes is one of the key issues in Wireless Sensor Networks. It is a precondition for a variety of applications, as well as geographic clustering and routing....
We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
This paper presents three techniques for using an iterated local search algorithm to improve the performance of a state-of-the-art branch and bound algorithm for job shop scheduli...
Abstract—In ad hoc position-location networks, location information is obtained through the sequential estimation of node locations. An unlocalized node can estimate its location...
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...