✦ LIBER ✦

The quadratic minimum spanning tree problem

✍ Scribed by Arjang Assad; Weixuan Xu

Publisher: John Wiley and Sons
Year: 1992
Tongue: English
Weight: 893 KB
Volume: 39
Category: Article
ISSN: 0894-069X
DOI: 10.1002/1520-6750(199204)39:3<399::aid-nav3220390309>3.0.co;2-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Counting Minimum Weight Spanning Trees

✍ Andrei Z. Broder; Ernst W. Mayr 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 152 KB

We present an algorithm for counting the number of minimum weight spanning trees, based on the fact that the generating function for the number of spanning trees of a given graph, by weight, can be expressed as a simple determinant. For a graph with n vertices and m edges, our Ž Ž .. Ž . algorithm r

Lower and upper bounds for the degree-co

Lower and upper bounds for the degree-constrained minimum spanning tree problem

✍ Alexandre Salles da Cunha; Abilio Lucena 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 1 views

The full-degree spanning tree problem

✍ Randeep Bhatia; Samir Khuller; Robert Pless; Yoram J. Sussmann 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB

The full-degree spanning tree problem is defined as follows: Given a connected graph G G G = (V V V, E E E), find a spanning tree T T T to maximize the number of vertices whose degree in T T T is the same as in G G G (these are called vertices of "full" degree). This problem is NP-hard. We present a

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

Stochastic bottleneck spanning tree prob

Stochastic bottleneck spanning tree problem

✍ Hiroaki Ishii; Toshio Nishida 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 296 KB

This paper considers a stochastic version of bottleneck spanning tree problem in which edge costs are random variables. The problem is to find an optimal spanning tree under the chance constraint with respect to bottleneck (maximum cost) edge of spanning tree. The problem is first transformed into a