𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Mini-Symposium. The Strong Governorship: Status and Problems

✍ Scribed by Duane Lockard, Victoria Schuck, Eugene J. Gleason and Joseph Zimmerman


Book ID
125241534
Publisher
John Wiley and Sons
Year
1976
Tongue
English
Weight
325 KB
Volume
36
Category
Article
ISSN
0033-3352

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A branch-and-bound algorithm for the min
✍ Takeo Yamada; Hideo Takahashi; Seiji Kataoka πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 657 KB

The mini-max spanning forest problem requires to find a spanning forest of an undirected graph that minimizes the maximum of the costs of constituent trees. In a previous work we proved this problem NP-hard. In the current paper we present three lower bounds for this problem and develop a branch-and