Salim Bouamama

Dr. Salim Bouamama

Department of Computer Science, Mechatronics Laboratory (LMETR)—E1764200, Ferhat Abbas University Sétif 1, Sétif 19000, Algeria
orcid

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2012 in Applied Soft Computing
Verified
Journal Article
Closed access
Salim BouamamaSalim Bouamama
Salim Bouamama
CBChristian Blum
Christian Blum
ABAbdellah Boukerram
Abdellah Boukerram

1 July 2019 in Applied Soft Computing
Verified
Journal Article
Closed access
Salim BouamamaSalim Bouamama
Salim Bouamama
CBChristian Blum
Christian Blum
JFJean-Guillaume Fages
Jean-Guillaume Fages

1 May 2016 in Simulation Modelling Practice and Theory
Verified
Journal Article
Closed access
Salim BouamamaSalim Bouamama
Salim Bouamama
CBChristian Blum
Christian Blum

28 February 2021 in Algorithms
Verified
Journal Article
Open access
PDF file
Salim BouamamaSalim Bouamama
Salim Bouamama
CBChristian Blum
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 in social networks. Its aim is to identify a small subset of key influential individuals in order to facilitate the spread of positive influence in the whole network. In this paper, we focus on the development of a fast and effective greedy heuristic for the MPIDS problem, because greedy heuristics are an essential component of more sophisticated metaheuristics. Thus, the development of well-working greedy heuristics supports the development of efficient metaheuristics. Extensive experiments conducted on a wide range of social networks and complex networks confirm the overall superiority of our greedy algorithm over its competitors, especially when the problem size becomes large. Moreover, we compare our algorithm with the integer linear programming solver CPLEX. While the performance of CPLEX is very strong for small and medium-sized networks, it reaches its limits when being applied to the largest networks. However, even in the context of small and medium-sized networks, our greedy algorithm is only 2.53% worse than CPLEX.

13 July 2019
Verified
Conference Paper
Open access
Pedro Pablo Pinacho DavidsonPedro Pablo Pinacho Davidson
Pedro Pablo Pinacho Davidson
Salim BouamamaSalim Bouamama
Salim Bouamama
CBChristian Blum
Christian Blum

31 May 2021 in Algorithms
Verified
Journal Article
Open access
PDF file
Samir BALBALSamir BALBAL
Samir BALBAL
Salim BouamamaSalim Bouamama
Salim Bouamama
CBChristian Blum
Christian Blum
Dominating sets are among the most well-studied concepts in graph theory, with many real-world applications especially in the area of wireless sensor networks. One way to increase network lifetime in wireless sensor networks consists of assigning sensors to disjoint dominating node sets, which are then sequentially used by a sleep–wake cycling mechanism. This paper presents a greedy heuristic for solving a weighted version of the maximum disjoint dominating sets problem for energy conservation purposes in wireless sensor networks. Moreover, an integer linear programming model is presented. Experimental results based on a large set of 640 problem instances show, first, that the integer linear programming model is only useful for small problem instances. Moreover, they show that our algorithm outperforms recent local search algorithms from the literature with respect to both solution quality and computation time.