### Table 1: Specializations of Network Design Problems with Connectivity Constraints

1999

"... In PAGE 6: ... In this application each node v in the graph has a connectivity requirement r and the connectivity require- ments between nodes s and t are given by rt = min{r, rt}. Table1 shows several other noteworthy cases of the NDC problem. A few observations concerning the entries in Table 1 are worth making.... In PAGE 6: ... Table 1 shows several other noteworthy cases of the NDC problem. A few observations concerning the entries in Table1 are worth making. The k-edge dis- joint path problem seeks, at minimum cost, k-edge disjoint paths between specified nodes s and t.... In PAGE 8: ...s a unitary NDC problem. Otherwise, it is a nonunitary NDC problem. For example, the SND problem is a unitary NDC problem, while the general Steiner forest problem is a nonunitary NDC problem. The examples in Table1 show that the NDC problem models a very wide variety of con- nectivity problems on graphs. These problems appear both as stand alone problems and as subproblems in more complex network design applications (like VLSI design and telecom- munications network design and management).... ..."

Cited by 6

### Table 1: Specializations of Network Design Problems with Connectivity Constraints

1999

"... In PAGE 2: ... In this application each node v in the graph has a connectivity requirement rv and the connectivity requirements be- tween nodes s and t are given by rst = minfrs; rtg. Table1 shows several other noteworthy cases of the NDC problem. A few observations concerning the entries in Table 1 are worth making.... In PAGE 2: ... Table 1 shows several other noteworthy cases of the NDC problem. A few observations concerning the entries in Table1 are worth making. The k-edge dis- joint path problem seeks, at minimum cost, k-edge disjoint paths between specified nodes s and t.... In PAGE 4: ...s a unitary NDC problem. Otherwise, it is a nonunitary NDC problem. For example, the SND problem is a unitary NDC problem, while the general Steiner forest problem is a nonunitary NDC problem. The examples in Table1 show that the NDC problem models a very wide variety of con- nectivity problems on graphs. These problems appear both as stand alone problems and as subproblems in more complex network design applications (like VLSI design and telecom- munications network design and management).... ..."

Cited by 6

### Table 2. Errors for the Specialized Neural Network.

### Table 4. Errors for the Specialized Neural Network with Varying Link Reliability.

1998

"... In PAGE 14: ...2 Networks with Varying Link Reliability This problem is much harder than that d escribed in the preceding section, however the ANN prediction performed well. Table 3 gives the results over the five fold cross validation for the general purpose ANN while Table4 gives the same results for the specialized ANN. It can be seen that the RMS error of the ANN is still significantly less than that of the upperbound.... ..."

Cited by 2

### Table 2. Errors for the Specialized Neural Network with Identical Link Reliability.

1998

Cited by 2

### TABLE VII SPECIALIZATION IMPROVEMENT.PRECISION RESULTS AFTER TRAINING ON THE ORIGINAL 500-SENTENCE TRAINING SET WITH SPECIALIZED NETWORKS (R500), AND AFTER TRAINING ON THE 40K TRAINING SET WITH AN UNSPECIALIZED NETWORK (Ru) AND SPECIALIZED NETWORKS (Rs). RELATIVE ERROR REDUCTION IS SHOWN IN THE FINAL COLUMN.

### TABLE VII SPECIALIZATION IMPROVEMENT.PRECISION RESULTS AFTER TRAINING ON THE ORIGINAL 500-SENTENCE TRAINING SET WITH SPECIALIZED NETWORKS (R500), AND AFTER TRAINING ON THE 40K TRAINING SET WITH AN UNSPECIALIZED NETWORK (Ru) AND SPECIALIZED NETWORKS (Rs). REDUCTION OF ERROR IS SHOWN IN THE FINAL COLUMN.

in Ambiguity

### Table 5 Compulsorily optional subjects for the Computer Systems and Networks specialization

### Table B.5: Specialization Lesions for simulation 3. All members of a specialization are removed from the network.

1995

Cited by 3