𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The maximum-leaf spanning tree problem: Formulations and facets

✍ Scribed by Tetsuya Fujie

Publisher
John Wiley and Sons
Year
2004
Tongue
English
Weight
196 KB
Volume
43
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

A tabu search algorithm for the Capacita
A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
✍ Sharaiha, Yazid M.; Gendreau, Michel; Laporte, Gilbert; Osman, Ibrahim H. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 150 KB πŸ‘ 2 views

The Capacitated Shortest Spanning Tree Problem consists of determining a shortest spanning tree in a vertex weighted graph such that the weight of every subtree linked to the root by an edge does not exceed a prescribed capacity. We propose a tabu search heuristic for this problem, as well as dynami