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

Algorithms for the optimum communication spanning tree problem

โœ Scribed by Prabha Sharma

Publisher
Springer US
Year
2006
Tongue
English
Weight
193 KB
Volume
143
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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

Spanning tree-based genetic algorithm fo
Spanning tree-based genetic algorithm for bicriteria transportation problem
โœ Mitsuo Gen; Yin-Zhen Li ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 371 KB

In this paper, we present a new approach which is spanning tree-based genetic algorithm for bicriteria transport,ation problem. The transportation problem have the special data structure in solution characterized as a spanning tree. In encoding transportation problem, we introduce one of node encodi

The hybrid spanning tree problem
The hybrid spanning tree problem
โœ Y.L. Chen ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 696 KB