Tag: optimization
-
Finding the Minimum k-Weighted Dominating Set — MATCOM 2024
Our paper “Finding the Minimum k-Weighted Dominating Sets Using Heuristic Algorithms” was published in Mathematics and Computers in Simulation (MATCOM), a journal by Elsevier focused on mathematical modeling and computational methods. The problem we tackle is a generalization of the classical dominating set problem in graph theory. In a standard dominating set, you want to…
-
Solving the Minimum Weighted Dominating Set Problem
Given a weighted graph, a dominating set is a subset of vertices such that every vertex outside the set is adjacent to at least one vertex inside it, and the sum of incident edge weights meets a minimum threshold K. Finding the smallest such set is NP-hard. This project implements an Iterated Greedy algorithm with…