✦ LIBER ✦

Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree

✍ Scribed by Mohan Krishnamoorthy; Andreas T. Ernst; Yazid M. Sharaiha

Book ID: 110308215
Publisher: Springer US
Year: 2001
Tongue: English
Weight: 163 KB
Volume: 7
Category: Article
ISSN: 1381-1231
DOI: 10.1023/a:1011977126230

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new algorithm for degree-constrained m

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

✍ Aibing Ning; Liang Ma; Xiaohua Xiong 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 163 KB

Edge exchanges in the degree-constrained

Edge exchanges in the degree-constrained minimum spanning tree problem

✍ Martin Savelsbergh; Ton Volgenant 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 725 KB

Lower and upper bounds for the degree-co

Lower and upper bounds for the degree-constrained minimum spanning tree problem

✍ Alexandre Salles da Cunha; Abilio Lucena 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 1 views

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 Lagrangean approach to the degree-cons

A Lagrangean approach to the degree-constrained minimum spanning tree problem

✍ A. Volgenant 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 451 KB

Exact algorithm for delay-constrained ca

Exact algorithm for delay-constrained capacitated minimum spanning tree network

✍ Lee, Y.J.; Atiquzzaman, M. 📂 Article 📅 2007 🏛 The Institution of Engineering and Technology 🌐 English ⚖ 273 KB