#Pl81# J. Plesnik,The complexity of designing a network with minimum diameter, Networks 11 #1981#, 77#85. #Rav94# R. Ravi,Rapid rumor rami#cation,Proceedings of the 35th Annual IEEE Symposium on the Foundations of Computer Science #FOCS'94#, November Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Approximation Algorithms for Certain Network Improvement Problems - Krumke, al. (1998) (3 citations) (Correct)
....is NP hard, the rational case is solvable in polynomial time using tools from matroid theory. Berman [2] considers the problem of shortening the edges of a given tree to minimize the weight of its shortest path tree and shows that the problem can be solved in strongly polynomial time. Plesnik [20] has shown that the budget constrained minimum diameter problem (i.e. given a graph G = V; E) with a length (e) and cost c(e) for each edge e 2 E and a cost budget B, select a subset E 0 of E so that the total cost of edges in E 0 13 is at most B and the diameter of the graph formed by E 0 ....
J. Plesnik, The complexity of designing a network with minimum diameter , Networks 11 (1981), pp. 77-85.
Improving Spanning Trees by Upgrading Nodes - Krumke, Marathe, Noltemeier.. (1997) (Correct)
.... 1= approximation algorithm. Generalized versions where there are other constraints (e.g. bound on maximum node degree) and the goal is to obtain a good Steiner tree, are considered in [5] Other references that address problems that can be interpreted as edge based improvement problems include [3, 8, 10]. 2 Upgrading Under Total Weight Constraint In this section we develop our approximation algorithm for the (Total Weight, Node Upgrading Cost, Spanning Tree) problem. Without loss of generality we assume that for a given instance of (Total Weight, Node Upgrading Cost, Spanning Tree) the bound D ....
J. Plesnik, "The Complexity of Designing a Network with Minimum Diameter", Networks, Vol. 11, 1981, pp. 77--85.
Massively Replicating Services in Wide-Area Internetworks - Danzig, DeLucia, Obraczka (1994) (12 citations) (Correct)
....the degree of node i of G 0 . Then, D i ffi where ffi is an upper bound on the node degree of G 0 . ffl The weighted sum of G 0 s diameter and edge cost function is minimal. This optimization problem is NP complete, but the literature records approximations for similar problems. Plesnik [14] proves that any algorithm that generates a minimum spanning subgraph of G, say G 0 (V; E 0 ) by selecting E 0 as subset of E with a given budget constraint and minimum diameter is NP hard. Johnson [8] states that constructing a subgraph which connects all vertices, and minimizes shortest ....
J. Plesnik. The complexity of designing a network with minimum diameter. Networks, 11:77--85, 1981.
Finding Low-Diameter, Low Edge-Cost, Networks - Obraczka, Danzig (1997) (Correct)
....integer k, construct a subgraph G 0 (V; E 0 ) with the following properties: ffl G 0 is k connected. ffl G has minimum diameter. ffl G has minimum total edge cost. In the next section, we review related literature and algorithms for solving similar problems. 1. 2 Related Work Plesnik [8] proves that any algorithm that generates a minimum spanning subgraph of G, say G 0 (V; E 0 ) by selecting E 0 as subset of E with a given budget constraint and minimum diameter is NP complete. Johnson [6] proves that constructing a subgraph which connects all vertices and minimizes the ....
J. Plesnik. The complexity of designing a network with minimum diameter. Networks, 11:77--85, 1981.
Approximation Algorithms for Certain Network Improvement Problems - al. (1998) (3 citations) (Correct)
....case is NP hard, the rational case is solvable in polynomial time using tools from matroid theory. Berman [2] considers the problem of shortening the edges of a given tree to minimize the weight of its shortest path tree and shows that the problem can be solved in strongly polynomial time. Plesnik [20] has shown that the budget constrained minimum diameter problem (i.e. given a graph G = V; E) with a length (e) and cost c(e) for each edge e 2 E and a cost budget B, select a subset E 0 of E so that the total cost of edges in E 13 is at most B and the diameter of the graph formed by E ....
J. Plesnik, The complexity of designing a network with minimum diameter , Networks 11 (1981), pp. 77--85.
Massively Replicating Services in Wide-Area Internetworks - Danzig, DeLucia, Obraczka (1994) (12 citations) (Correct)
....has node connectivity k. ffl D i , the degree of node i of G 0 , satisfies D i ffi . ffl The weighted sum of G 0 s diameter and edge cost function is minimal. 3.3 Related Work This optimization problem is NP complete, but the literature records approximations for similar problems. Plesnik [15] proves that any algorithm that generates a minimum spanning subgraph of G, say G 0 (V; E 0 ) Configuration for site w. Define site w ( site define ; What we are defining. site name w) A convenient name for the sites. hostname w) The hostname where this site is located. ....
J. Plesnik. The complexity of designing a network with minimum diameter. Networks, 11:77--85, 1981.
Modifying Edges of a Network to Obtain Short Subgroups - Drangmeister, Krumke.. (1996) (Correct)
No context found.
#Pl81# J. Plesnik,The complexity of designing a network with minimum diameter, Networks 11 #1981#, 77#85. #Rav94# R. Ravi,Rapid rumor rami#cation,Proceedings of the 35th Annual IEEE Symposium on the Foundations of Computer Science #FOCS'94#, November
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