✦ LIBER ✦

Greedy heuristics for the diameter-constrained minimum spanning tree problem

✍ Scribed by C. Requejo; E. Santos

Publisher: Springer US
Year: 2009
Tongue: English
Weight: 385 KB
Volume: 161
Category: Article
ISSN: 1573-8795
DOI: 10.1007/s10958-009-9611-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

On the minimum diameter spanning tree pr

On the minimum diameter spanning tree problem

✍ Refael Hassin; Arie Tamir 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 199 KB

Modeling hop-constrained and diameter-co

Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs

✍ Luis Gouveia; Luidi Simonetti; Eduardo Uchoa 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 452 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

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