✦ LIBER ✦

On the minimum diameter spanning tree problem

✍ Scribed by Refael Hassin; Arie Tamir

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 199 KB
Volume: 53
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(94)00183-y

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

The Capacitated Minimum Spanning Tree

✍ K. M. Chandy; Tachen Lo 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 386 KB

## Abstract The capacitated minimum spanning tree is an offspring of the minimum spanning tree and network flow problems. It has application in the design of multipoint linkages in elementary teleprocessing tree networks. Some theorems are used in conjunction with Little's branch and bound algorith

The most vital edges in the minimum span

The most vital edges in the minimum spanning tree problem

✍ Kao-Chêng Lin; Maw-Sheng Chern 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 490 KB

On stochastic spanning tree problem

✍ S. Geetha; K. P. K. Nair 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 443 KB

This paper considers a generalized version of the stochastic spanning tree problem in which edge costs are random variables and the objective is to find a spectrum of optimal spanning trees satisfying a certain chance constraint whose right-hand side also is treated as a decision variable. A special

On Minimum Edge Ranking Spanning Trees

✍ Kazuhisa Makino; Yushi Uno; Toshihide Ibaraki 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 243 KB

In this paper, we introduce the problem of computing a minimum edge ranking spanning tree (MERST); i.e., find a spanning tree of a given graph G whose edge ranking is minimum. Although the minimum edge ranking of a given tree can be computed in polynomial time, we show that problem MERST is NP-hard.