Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
— The relay node placement problem for wireless sensor networks is concerned with placing a minimum number of relay nodes into a wireless sensor network to meet certain connectiv...
Satyajayant Misra, Seung Don Hong, Guoliang Xue, J...
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0;1]d and a degree constraint b 2. The aim is to nd a minimum weight spannin...
Given a graph H = (V, F) with edge weights {w(e) : e F}, the weighted degree of a node v in H is {w(vu) : vu F}. We give bicriteria approximation algorithms for problems that see...
: In this paper we use an analytical model to study how two radio networks : a primary network and a secondary network can coexist within the same area. We use a very simple protoc...