J. Krarup, Generalized Steiner problem, unpublished note, 1978. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Two-connected Augmentation Problems in Planar Graphs - Provan, Burk (1996) (Correct)
....6. 1 Heuristic for a Network Design Problem The construction of networks with specified connectivity levels between vertices has been of considerable interest [20] recently with regard to telephone system design [4, 16, 21] The version of ECAP or VCAP considered in these papers was introduced in [19], and involves instance (G; w; S; r) where the subgraph S is not connected, and the connectivity requirements are of the form r ij = minfr i ; r j g, where r is a vector of node connectivity requirements. This version remains NP hard even when G is planar and all r i = 2, as mentioned ....
J. Krarup, Generalized Steiner problem, unpublished note, 1978.
When trees collide: An approximation algorithm for the.. - Agrawal, Klein, Ravi (1994) (57 citations) (Correct)
....and Hu [13] Gomory and Hu and later Sridhar and Chandrasekaran [35] address the synthesis problem for the special case where the input graph is the complete graph with all costs identical. The problem is also essentially identical to the generalized Steiner problem as formulated by Krarup ([26], as cited in [41] The problem is referred to as the design of minimum cost survivable networks in the work of Steiglitz, Weiner, and Kleitman [36] These researchers pose the problem of finding a subgraph of minimum cost satisfying given connectivity requirements. The problem we address differs ....
J. Krarup, "The generalized Steiner problem," Unpublished note (1978).
Steiner Trees and Beyond: Approximation Algorithms for Network.. - Ravi (1993) (Correct)
....specifications that require one connected or acyclic networks. The spanning tree [98, 127] specification is a special case of a Steiner tree in which all the nodes in the graph are specified as terminals. Thus a spanning tree is a subgraph which connects all the nodes. A generalized Steiner forest [97, 2] generalizes the notion of a Steiner tree. Given a set of site pairs of nodes, a generalized Steiner forest is a network in which there is a path between every site pair. Note that this specification can be easily used to model that of a Steiner tree: choose any terminal in a Steiner tree ....
J. Krarup, "The generalized Steiner problem," unpublished note (1978).
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