In this paper we propose three metaheuristic approaches, namely a Tabu Search, an
Evolutionary Computation and an Ant Colony Optimization approach, for the edge-weighted …

Given an undirected graph G=(V, E) with edge weights and a positive integer number k, the
k-cardinality tree problem consists of finding a subtree T of G with exactly k edges and the …

Abstract The Max Tree Coverage (MTC) problem is the dual of the classic k-MST problem
and has wide applications in areas such as network design and vehicle routing. Given a …

This paper studies the minimum edge-dilation K-center (MEDKC) problem for edge-
weighted, undirected and connected graphs. This problem which is NP-hard holds …

The rooted Max Tree Coverage (MTC) problem has wide applications in areas such as
network design and vehicle routing. Given a graph with nonnegative costs defined on …

In this paper we revisit an existing dynamic programming algorithm for finding optimal
subtrees in edge weighted trees. This algorithm was sketched by Maffioli in a technical …

Given an undirected defining graph for the k-Cardinality Tree Problem (KCTP), an
associated directed graph involving two additional vertices is introduced in this paper and …

The rapid aging of the world's population is causing an increase in the prevalence of
cognitive decline and degenerative brain disease in the elderly. Current diagnoses of …

The minimum weighted k-cardinality tree subgraph problem consists in finding, in a given
undirected weighted graph G (V, E, W), a tree T⊆ E of k edges having minimal total weight …

In this paper, we present two genetic algorithms (GA) for solving the minimum edge-dilation
k-center (MEDKC) problem. Up to now, MEDKC has been considered only theoretically, and …