Duin, C. W. and Volgenant, A. (1989a). An edge elimination test for the steiner problem in graphs. Operation Research Letters, 8:79--83. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Degree-Constrained Multicasting in Point-to-Point Networks - Bauer, Varma (1995) (27 citations) (Correct)
....the partial solution. The modifications reduce the size of the initial graph, reducing subsequent heuristic run time. Our empirical evidence suggests that on sparse networks even simple graph reductions may reduce their size as much as 15 . Graph reductions have been extensively reviewed elsewhere [10, 11, 27]. A short list of such reductions follows. 1. S degree 1. A non member node that is a leaf of graph G cannot be a part of the solution and may be deleted. Thus, if G contains S nodes of degree 1, delete each such node and its adjacent edge. Note that this reduction reduces the degree of the ....
....reductions applied, simple as they might seem, achieved remarkable results. We restricted ourselves to graph reductions S degree 1, S degree 2, and Z degree 1 because these were of reasonable cost and could be applied to the degree constrained case. We had to discard many other graph reductions [10, 11, 27] because they eliminated nodes and edges 0 200 400 600 800 1000 0.6 0.7 0.8 0.9 1 1.1 1.2 1.3 1.4 1.5 QOS Ratio (Constrained Unconstrained) Kruskal Simple Repetitive Naive DualAscent Figure 8: Quality of solution ratios when maximum degree constraint = 3. 0 200 400 600 800 1000 0.3 0.4 0.5 0.6 ....
C. Duin and A. Volgenant. "An edge elimination test for the Steiner problem in graphs," Operations Research Letters, vol. 8, pp. 79--83, 1989.
Multicast Routing in Point-to-Point Networks Under Constraints - Bauer (1996) (3 citations) (Correct)
....the partial solution. The modifications reduce the size of the initial graph, reducing subsequent heuristic runtime. Our empirical evidence suggests that on sparse networks even simple graph reductions may reduce their size as much as 15 . Graph reductions have been extensively reviewed elsewhere [15, 16, 50]. A short list of such reductions follows. 1. S degree 1. A non member node that is a leaf of graph G cannot be a part of the solution and may be deleted. Thus, if G contains S nodes of degree 1, delete each such node and its adjacent edge. Note that this reduction reduces the degree of the ....
....applied, simple as they might seem, achieved remarkable results. We restricted ourselves to graph reductions S degree 1, S degree 2, and Z degree 1 because these were of reasonable running time and could be applied to the degree constrained case. We had to discard many other graph reductions [15, 16, 50] because they eliminated nodes and edges needed in the degree constrained case. For example, some graph reductions identify shortest paths between multicast group members as solution edges, eliminating longer paths. However, in the degree constrained case, the multicast tree containing this ....
C. Duin and A. Volgenant. "An edge elimination test for the Steiner problem in graphs," Operations Research Letters, vol. 8, pp. 79--83, 1989.
Solving Steiner Tree Problems in Graphs to Optimality - Koch, Martin (1996) (26 citations) (Correct)
No context found.
Duin, C. W. and Volgenant, A. (1989a). An edge elimination test for the steiner problem in graphs. Operation Research Letters, 8:79--83.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC