A metaheuristic approach to the dominating tree problem-Reference-Cited by-同舟云学术

A metaheuristic approach to the dominating tree problem

Published:2016-02-29 Issue:6 Volume:11 Page:1155-1167
ISSN:1862-4472
Container-title:Optimization Letters
language:en
Short-container-title:Optim Lett

Author:

Dražić Zorica,Čangalović Mirjana,Kovačević-Vujčić Vera

Funder

Serbian Ministry of Science

Publisher

Springer Science and Business Media LLC

Subject

Control and Optimization

Link

http://link.springer.com/article/10.1007/s11590-016-1017-5/fulltext.html

Reference16 articles.

1. Arkin, E.M., Halldorsson, M.M., Hassin, R.: Approximating the tree and tour covers of a graph. Inf. Process. Lett. 47(6), 275–282 (1993)

2. Demšar, J.: Statistical comparisons of classifiers over multiple data sets. J. Mach. Learn. Res. 7, 1–30 (2006)

3. Fujito, T.: On approximability of the independent/connected edge dominating set problems. Inf. Process. Lett. 79(6), 261–266 (2001)

4. Fujito, T.: How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover, Automata, Languages and Programming, pp. 431–442. Springer, Berlin, Heidelberg (2006)

5. Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20(4), 374–387 (1998)

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A new local search algorithm with greedy crossover restart for the dominating tree problem;Expert Systems with Applications;2023-11

2. Dual-Neighborhood Search for Solving the Minimum Dominating Tree Problem;Mathematics;2023-10-09

3. A two-level meta-heuristic approach for the minimum dominating tree problem;Frontiers of Computer Science;2022-12-13

4. An Efficient Memetic Algorithm for the Minimum Load Coloring Problem;Mathematics;2019-05-25

5. A Hybrid Framework Combining Genetic Algorithm with Iterated Local Search for the Dominating Tree Problem;Mathematics;2019-04-19