Ant colony optimization applied to minimum weight dominating set problem

Authors:
Raka Jovanovic;Milan Tuba;Dana Simian
Affiliations:
Texas AM University at Qatar, Doha, Qatar;Faculty of Computer Science, Megatrend University Belgrade, Serbia;Department of Computer Science, Lucian Blaga University of Sibiu, Romania
Venue:
ACMOS'10 Proceedings of the 12th WSEAS international conference on Automatic control, modelling & simulation
Year:
2010

Citing 5
Cited 2

Analysis of a greedy heuristic for finding small dominating sets in graphs

Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
An object-oriented framework with corresponding graphical user interface for developing ant colony optimization based algorithms

WSEAS Transactions on Computers
Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor

Parameterized and Exact Computation
Minimum Connected Dominating Set Using a Collaborative Cover Heuristic for Ad Hoc Sensor Networks

IEEE Transactions on Parallel and Distributed Systems

Ant colony inspired self-optimized routing protocol based on cross layer architecture for wireless sensor networks

WSEAS TRANSACTIONS on COMMUNICATIONS
Hybrid metaheuristic algorithms for minimum weight dominating set

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present an application of ant colony optimization (ACO) to the Minimum Weighted Dominating Set Problem. We introduce a heuristic for this problem that takes into account the weights of vertexes being covered and show that it is more efficient than the greedy algorithm using the standard heuristic. Further we give implementation details of ACO applied to this problem. We tested our algorithm on graphs with different sizes, edge densities, and weight distribution functions and shown that it gives greatly improved results over these acquired by the greedy algorithms.