Exact algorithms for finding constrained minimum spanning trees-Reference-Cited by-同舟云学术

Exact algorithms for finding constrained minimum spanning trees

Published:2020-05-05 Issue: Volume: Page:
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Yao Pei,Guo Longkun^ORCID

Funder

National Natural Science Foundation of China

Natural Science Foundation of Fujian Province

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

https://link.springer.com/content/pdf/10.1007/s10878-020-00579-z.pdf

Reference16 articles.

1. Aggarwal V, Aneja YP, Nair KPK (1982) Minimal spanning tree subject to a side constraint. Comput Oper Res 9(4):287–296

2. Alfandari L, Paschos VT (1999) Approximating minimum spanning tree of depth 2. Int Trans Oper Res 6(6):607–622

3. Bicalho LH, Cunha ASD, Lucena A (2016) Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem. Comput Optim Appl 63(3):1–38

4. Boldon B, Deo N, Kumar N (1996) Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an simd parallel machine. Parallel Comput 22(3):369–382

5. Dahl G (1998) The 2-hop spanning tree problem. Oper Res Lett 23(1):21–26

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

1. Axon Arbor Trade-off Between Wiring Cost, Delay, and Synchronization in Neuronal Networks;2021 55th Annual Conference on Information Sciences and Systems (CISS);2021-03-24