✦ LIBER ✦

Improved Heuristics for the Minimum Label Spanning Tree Problem

✍ Scribed by Yupei Xiong; Golden, B.; Wasil, E.

Book ID: 117914763
Publisher: IEEE
Year: 2006
Tongue: English
Weight: 313 KB
Volume: 10
Category: Article
ISSN: 1089-778X
DOI: 10.1109/tevc.2006.877147

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved heuristics for the bounded-diam

Improved heuristics for the bounded-diameter minimum spanning tree problem

✍ Alok Singh; Ashok K. Gupta 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 423 KB

Greedy heuristics for the diameter-const

Greedy heuristics for the diameter-constrained minimum spanning tree problem

✍ C. Requejo; E. Santos 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 385 KB

Worst-case behavior of the MVCA heuristi

Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem

✍ Yupei Xiong; Bruce Golden; Edward Wasil 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 185 KB

In this paper, we review recent work on the minimum labeling spanning tree problem and obtain a new worst-case ratio for the MVCA heuristic. We also present a family of graphs in which the worst-case ratio can be attained. This implies that the new ratio cannot be improved any further.

A hybrid heuristic for the diameter cons

A hybrid heuristic for the diameter constrained minimum spanning tree problem

✍ Abilio Lucena; Celso C. Ribeiro; Andréa C. Santos 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 363 KB

A mixed integer linear formulation for t

A mixed integer linear formulation for the minimum label spanning tree problem

✍ M.Eugénia Captivo; João C.N. Clímaco; Marta M.B. Pascoal 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 114 KB

The minimum labeling spanning trees

✍ Ruay-Shiung Chang; Leu Shing-Jiuan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 449 KB

One of the fundamental problems in graph theory is to compute a minimum weight spanning tree. In this paper, a variant of spanning trees, called the minimum labeling spanning tree, is studied. The purpose is to find a spanning tree that tries to use edges that are as similar as possible. Giving each