Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine-Reference-Cited by-同舟云学术

Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine

Published:1996-03 Issue:3 Volume:22 Page:369-382
ISSN:0167-8191
Container-title:Parallel Computing
language:en
Short-container-title:Parallel Computing

Author:

Boldon Bruce,Deo Narsingh,Kumar Nishit

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Graphics and Computer-Aided Design,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference30 articles.

1. Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine;Boldon;Technical Report, Dept. of Comp. Science, Univ. of Central Florida, Orlando, CS-TR-95-02,1995

2. Complexity of spanning tree problems: Part I;Camerini;Eur. J. Oper. Res.,1980

3. On the complexity of finding multi-constrained spanning trees;Camerini;Disc. Appl. Math.,1983

4. The complexity of weighted constrained spanning trees;Camerini,1984

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

1. NeuroPrim: An attention-based model for solving NP-hard spanning tree problems;Science China Mathematics;2024-02-22

2. A Hybrid Artificial Bee Colony Algorithm for the Degree-Constrained Minimum Spanning Tree Problem;Lecture Notes in Electrical Engineering;2023

3. Design of capacitated degree constrained min-sum arborescence;OPSEARCH;2022-06-27

4. A computational study on the Maximum-Weight Bounded-Degree Rooted Tree Problem;Applied Mathematics and Computation;2022-01

5. An Iterated Local Search Algorithm for the Degree-Constrained Minimum Spanning Tree Problem;Artificial Intelligence and Sustainable Computing;2022