The dominating tree problem (DTP), a variant of the classical minimum dominating set
problem, aims to find a dominating tree of minimum costs on a given connected, undirected …

Given an undirected, connected, edge-weighted graph G and a positive integer d, the
degree-constrained minimum spanning tree (dc-MST) problem aims to find a minimum …

This paper presents a new hybrid approach (NN SGGA) combining steady-state grou**
genetic algorithm with a local search for the maximally diverse grou** problem (MDGP) …

Test case generation is an important process in software testing. However, manual
generation of test cases is a time-consuming process. Automation can considerably reduce …

Given an undirected, connected and edge-weighted graph, the dominating tree problem
consists of finding a tree with minimum total edge weight such that for each vertex is either in …

A tree t-spanner, in a given connected graph, is a spanning tree T in which the distance
between every two vertices in T is at most t times their shortest distance in the graph, where …

Dominating set problems are among the most important class of combinatorial problems in
graph optimization, from a theoretical as well as from a practical point of view. In this paper …

Abstract Dominating Tree Problem (DTP) aims to find a dominating tree (d T ree) of minimum
cost on a given connected, undirected and weighted graph in such a way that a vertex in the …

Dominating tree problem (DTP) seeks a tree DT with minimum total edge weight on a given
edge-weighted, connected, and undirected graph so that each vertex of the graph is either a …