Variable neighborhood search for weighted total domination problem and its application in social network information spreading
The weighted total domination problem (WTDP) is a practical extension of the well-known
total domination problem. The most efficient literature approaches to tackle this problem are …
total domination problem. The most efficient literature approaches to tackle this problem are …
Exact and heuristic algorithms for the weighted total domination problem
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 …
graph optimization, from a theoretical as well as from a practical point of view. In this paper …
[BUCH][B] Convex optimization techniques for geometric covering problems
JH Rolfes - 2021 - books.google.com
The present thesis is a commencement of a generalization of covering results in specific
settings, such as the Euclidean space or the sphere, to arbitrary compact metric spaces. In …
settings, such as the Euclidean space or the sphere, to arbitrary compact metric spaces. In …