Bottleneck Steiner Subnetwork Problems with k-Connectivity Constraints
暂无分享,去创建一个
[1] Paolo M. Camerini. The Min-Max Spanning Tree Problem and Some Extensions , 1978, Inf. Process. Lett..
[2] R. G. Parker,et al. Guaranteed performance heuristics for the bottleneck travelling salesman problem , 1984 .
[3] Chuan Yi Tang,et al. Solving the Euclidean Bottleneck Biconnected Edge Subgraph Problem by 2-Relative Neighborhood Graphs , 1992, Discret. Appl. Math..
[4] Zvi Galil,et al. Reducing edge connectivity to vertex connectivity , 1991, SIGA.
[5] Abraham P. Punnen,et al. A Fast and Simple Algorithm for the Bottleneck Biconnected Spanning Subgraph Problem , 1994, Inf. Process. Lett..
[6] Michel Minoux,et al. Graphs and Algorithms , 1984 .
[7] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[8] Pawel Winter,et al. Steiner problem in networks: A survey , 1987, Networks.
[9] T. Ibaraki,et al. A linear time algorithm for computing 3-edge-connected components in a multigraph , 1992 .