|
|
|
|
|
Lev Kazakovtsev, Ivan Rozhnov and Guzel Shkaberina
The continuous p-median problem (CPMP) is one of the most popular and widely used models in location theory that minimizes the sum of distances from known demand points to the sought points called centers or medians. This NP-hard location problem is also...
ver más
|
|
|
|
|
|
|
|
|
Salim Bouamama and Christian Blum
This paper presents a performance comparison of greedy heuristics for a recent variant of the dominating set problem known as the minimum positive influence dominating set (MPIDS) problem. This APX-hard combinatorial optimization problem has applications...
ver más
|
|
|
|
|
|
|
|
|
Mohammad M Alnabhan
Pág. pp. 107 - 131
This work aims to develop the routing capability of GPSR in MANETs. A new GPSR advancement described as Adaptive GPSR (AGPSR) is proposed with enhanced greedy forwarding and efficient routing decision. AGPSR greedy forwarding model consists of three majo...
ver más
|
|
|
|
|
|
|
|
|
Canh V. Pham, Dung K. T. Ha, Quang C. Vu, Anh N. Su and Huan X. Hoang
The Influence Maximization (????
IM
) problem, which finds a set of k nodes (called seedset) in a social network to initiate the influence spread so that the number of influenced nodes after propagation process is maximized, is an important problem in in...
ver más
|
|
|
|
|
|
|
|
|
Amir Mirzaeinia and Mostafa Hassanalian
The development of new concepts for smart cities and the application of drones in this area requires different architecture for the drones? stations (nests) and their placement. Drones? stations are designed to protect drones from hazards and utilize cha...
ver más
|
|
|
|