✦ LIBER ✦

A new algorithm for degree-constrained minimum spanning tree based on the reduction technique

✍ Scribed by Aibing Ning; Liang Ma; Xiaohua Xiong

Book ID: 113855681
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 163 KB
Volume: 18
Category: Article
ISSN: 1002-0071
DOI: 10.1016/j.pnsc.2007.11.014

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Comparison of Algorithms for the Degree

Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree

✍ Mohan Krishnamoorthy; Andreas T. Ernst; Yazid M. Sharaiha 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 163 KB

A new evolutionary approach to the degre

A new evolutionary approach to the degree-constrained minimum spanning tree problem

✍ Knowles, J.; Corne, D. 📂 Article 📅 2000 🏛 IEEE 🌐 English ⚖ 202 KB

A note on genetic algorithms for degree-

A note on genetic algorithms for degree-constrained spanning tree problems

✍ Zhou, Gengui; Gen, Mitsuo 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 58 KB 👁 2 views

The degree-constrained spanning tree problem is of high practical importance. Up to now, there are few effective algorithms to solve this problem because of its NP-hard complexity. In this paper, we present a new approach to solve this problem by using genetic algorithms and computational results to

A branch and cut method for the degree-c

A branch and cut method for the degree-constrained minimum spanning tree problem

✍ L. Caccetta; S.P. Hill 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 2 views

On symbolic OBDD-based algorithms for th

On symbolic OBDD-based algorithms for the minimum spanning tree problem

✍ Beate Bollig 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 310 KB

A one-parameter genetic algorithm for th

A one-parameter genetic algorithm for the minimum labeling spanning tree problem

✍ Yupei Xiong; Golden, B.; Wasil, E. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 410 KB