An adaptive heuristic to the bounded-diameter minimum spanning tree problem-Reference-Cited by-同舟云学术

An adaptive heuristic to the bounded-diameter minimum spanning tree problem

Published:2012-06-14 Issue:11 Volume:16 Page:1977-1988
ISSN:1432-7643
Container-title:Soft Computing
language:en
Short-container-title:Soft Comput

Author:

Akbari Torkestani Javad

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-012-0869-6.pdf

Reference53 articles.

1. Abdalla A, Deo N, Gupta P (2000) Random-tree diameter and the diameter-constrained MST. Congressus Numerantium 144:161–182

2. Achuthan NR, Caccetta L, Caccetta P, Geelen A (1994) Computational methods for the diameter restricted minimum-weight spanning tree problem. Aust J Comb 10:51–71

3. Aggarwal V, Aneja Y, Nair K (1982) Minimal spanning tree subject to a side constraint. Comput Oper Res 9:287–296

4. Akbari Torkestani J (2012a) Degree constrained minimum spanning tree problem in stochastic graph. J Cybern Syst 43(1):1–21

5. Akbari Torkestani J (2012b) An adaptive backbone formation algorithm for wireless sensor networks. Comput Commun (in press)

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

1. Simulated Annealing Algorithm for the Bounded Diameter Minimum Spanning Tree Problem;Proceedings of the Companion Conference on Genetic and Evolutionary Computation;2023-07-15

2. Delay-constrained minimum shortest path trees and related problems;Theoretical Computer Science;2023-01

3. Artificial bee colony algorithm using permutation encoding for the bounded diameter minimum spanning tree problem;Soft Computing;2021-07-08

4. Delay-Constrained Minimum Shortest Path Trees and Related Problems;Combinatorial Optimization and Applications;2021

5. Serial and parallel memetic algorithms for the bounded diameter minimum spanning tree problem;Expert Systems;2020-08