๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Approximation Algorithms for Quickest Spanning Tree Problems

โœ Scribed by Refael Hassin; Asaf Levin

Publisher
Springer
Year
2004
Tongue
English
Weight
161 KB
Volume
41
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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 Faster Algorithm for the Inverse Spann
A Faster Algorithm for the Inverse Spanning Tree Problem
โœ Ravindra K. Ahuja; James B. Orlin ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 149 KB

In this paper, we consider the inverse spanning tree problem. Given an undi-0 ลฝ 0 0 . rected graph G s N , A with n nodes, m arcs, an arc cost vector c, and a spanning tree T 0 , the inverse spanning tree problem is to perturb the arc cost vector c to a vector d so that T 0 is a minimum spanning tre