A hybrid heuristic for dominating tree problem
Author:
Publisher
Springer Science and Business Media LLC
Subject
Geometry and Topology,Theoretical Computer Science,Software
Link
http://link.springer.com/content/pdf/10.1007/s00500-014-1513-4.pdf
Reference15 articles.
1. Arkin EM, Halldórsson MM, Hassin R (1993) Approximating the tree and tour covers of a graph. Inf Process Lett 47:275–282
2. Fujito T (2001) On approximability of the independent/connected edge dominating set problems. Inf Process Lett 79:261–266
3. Fujito T (2006) How to trim an mst: a 2-approximation algorithm for minimum cost tree cover. In: Bugliesi M, Preneel B, Sassone V, Wegener I (eds) Automata, languages and programming, Lecture Notes in Computer Science, vol 4051. Springer, Berlin, Heidelberg, pp 431–442
4. Guha S, Khuller S (1998) Approximation algorithms for connected dominating sets. Algorithmica 20(4):374–387
5. Park MA, Willson J, Wang C, Thai M, Wu W, Farago A (2007) A dominating and absorbent set in a wireless ad-hoc network with different transmission ranges. In: Proceedings of the 8th ACM international symposium on mobile ad hoc networking and computing, MobiHoc ’07. ACM, New York, pp 22–31
Cited by 12 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 evolutionary algorithm based hyper-heuristic framework for the set packing problem;Information Sciences;2019-12
5. A Hybrid Framework Combining Genetic Algorithm with Iterated Local Search for the Dominating Tree Problem;Mathematics;2019-04-19
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3