Article ID: | iaor19982966 |
Country: | United States |
Volume: | 8 |
Issue: | 4 |
Start Page Number: | 361 |
End Page Number: | 366 |
Publication Date: | Sep 1996 |
Journal: | INFORMS Journal On Computing |
Authors: | Berman Oded, Averbakh Igor |
Keywords: | Steiner problem |
The objective is to connect a given set of terminal nodes of a network by a subnetwork of maximum bottleneck capacity. The bottleneck capacity of a subnetwork is the minimum of the capacities of its edges. For the problem with the additional requirement that the connecting subnetwork must be