𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The hybrid spanning tree problem

✍ Scribed by Y.L. Chen

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
696 KB
Volume
77
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Stochastic spanning tree problem
Stochastic spanning tree problem
✍ Hiroaki Ishii; Shōgo Shiode; Toshio Nishida; Yoshikazu Namasuya πŸ“‚ Article πŸ“… 1981 πŸ› Elsevier Science 🌐 English βš– 485 KB
The full-degree spanning tree problem
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
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