Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Boosting ACO with a Preprocessing Step
Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Distributed Clustering for Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
A study of ACO capabilities for solving the maximum clique problem
Journal of Heuristics
Query Selection Techniques for Efficient Crawling of Structured Web Sources
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Efficient Distributed Low-Cost Backbone Formation for Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
A 5+epsilon (Porson)-approximation algorithm for minimum weighted dominating set in unit disk graph
Theoretical Computer Science
Ant colony optimization applied to minimum weight dominating set problem
ACMOS'10 Proceedings of the 12th WSEAS international conference on Automatic control, modelling & simulation
Multi-document summarization via the minimum dominating set
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
A PTAS for the minimum dominating set problem in unit disk graphs
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs
Journal of Combinatorial Optimization
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
Gateway Placement Optimization in Wireless Mesh Networks With QoS Constraints
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Minimum weight dominating set (MWDS) finds many uses in solving problems as varied as clustering in wireless networks, multi-document summarization in information retrieval and so on. It is proven to be NP-hard, even for unit disk graphs. Many centralized and distributed, greedy and approximation algorithms have been proposed for the MWDS problem. However, all the approximation algorithms are limited to unit disk graphs which are primarily used to model wireless networks. This assumption fails when applied to other domains. In this paper, we present two metaheuristic algorithms - a hybrid genetic algorithm and a hybrid ant colony optimization algorithm - for the problem of computing minimum weight dominating set. We compare our results with that of a greedy heuristic as well as the only other metaheuristic algorithm proposed so far in the literature and show that our algorithms are far better than these algorithms.