✦ LIBER ✦

Relaxation methods for the Generalized Minimum Spanning Tree Problem

✍ Scribed by P.C. Pop; W. Kern; G. Still; U. Faigle

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 185 KB
Volume: 8
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(05)80085-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the generalized minimum spanning tree

On the generalized minimum spanning tree problem

✍ Young-Soo Myung; Chang-Ho Lee; Dong-Wan Tcha 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 748 KB

The quadratic minimum spanning tree prob

The quadratic minimum spanning tree problem

✍ Arjang Assad; Weixuan Xu 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 893 KB

A comparative analysis of several formul

A comparative analysis of several formulations for the generalized minimum spanning tree problem

✍ Corinne Feremans; Martine Labbé; Gilbert Laporte 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 423 KB 👁 1 views

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

The generalized minimum spanning tree pr

The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm

✍ Corinne Feremans; Martine Labbé; Gilbert Laporte 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 209 KB 👁 1 views

Offline Algorithms for Dynamic Minimum S

Offline Algorithms for Dynamic Minimum Spanning Tree Problems

✍ D. Eppstein 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 651 KB

We describe an efficient algorithm for maintaining a minimum spanning tree (MST) in a graph subject to a sequence of edge weight modifications. The sequence of minimum spanning trees is computed offline, after the sequence of modifications is known. The algorithm takes time \(O(k \log n)\) for a seq