✦ LIBER ✦

New heuristics for two bounded-degree spanning tree problems

✍ Scribed by Shyam Sundar; Alok Singh; André Rossi

Book ID: 113662332
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 640 KB
Volume: 195
Category: Article
ISSN: 0020-0255
DOI: 10.1016/j.ins.2012.01.037

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

Approximating the Degree-Bounded Minimum

Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem

✍ Jochen Könemann; Asaf Levin; Amitabh Sinha 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 944 KB

An adaptive heuristic to the bounded-dia

An adaptive heuristic to the bounded-diameter minimum spanning tree problem

✍ Akbari Torkestani, Javad 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 833 KB

Models and heuristics for the k -degree

Models and heuristics for the k -degree constrained minimum spanning tree problem with node-degree costs

✍ Christophe Duhamel; Luís Gouveia; Pedro Moura; Maurício de Souza 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 319 KB 👁 1 views

## Abstract The __k__ ‐Degree constrained Minimum Spanning Tree Problem (__k__ ‐DMSTP) consists in finding a minimal cost spanning tree satisfying the condition that every node has a degree no greater than a fixed value __k__. Here we consider an extension where besides the edge costs, a concave co

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

Improved Heuristics for the Minimum Labe

Improved Heuristics for the Minimum Label Spanning Tree Problem

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