O. Berman Improving the location of minisum facilities through network modi cation Annals of Operations Research 40 (1992), 1-16. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Modifying Edges of a Network to Obtain Short Subgraphs - Drangmeister, Krumke, al. (2000) (3 citations) (Correct)
....in a graph subject to a budget constraint where the cost functions are assumed to be linear in the weight increase. In contrast to the results presented here, they show that while the integral case is NP hard, the rational case is solvable in polynomial time using tools from matroid theory. Berman [2] considers the problem of shortening edges in a given tree to minimize its shortest path tree weight and shows that the problem can be solved in strongly polynomial time. Phillips [19] studies the problem of nding an optimal strategy for reducing the capacity of the network so that the residual ....
....path tree weight and shows that the problem can be solved in strongly polynomial time. Phillips [19] studies the problem of nding an optimal strategy for reducing the capacity of the network so that the residual capacity in the modi ed network is minimized. The problems studied here and in [2, 19] can be broadly classi ed as types of bicriteria problems. Recently, there has been substantial work on nding ecient approximation algorithms for a variety of bicriteria problems (see [13, 14, 17, 20 23] and the references therein) 5 Structure of an Optimal Solution T 2 T 1 (v 1 ; v 4 ) v ....
O. Berman, Improving the location of minisum facilities through network modication, Annals of Operations Research, 40 (1992), pp. 1-16.
Improving Minimum Cost Spanning Trees by Upgrading Nodes - Krumke, Marathe.. (Correct)
.... namely the bottleneck weight of a minimum bottleneck spanning tree, leads to the problem (NODE UPGRADING COST, BOTTLENECK WEIGHT, SPANNING TREE) This bottleneck problem has been investigated in [KM 97] 4 Edge based network upgrading problems have also been considered in the literature [Ber92, KN 96b, KN 96a] There, each edge has a current weight and a minimum weight (below which the edge weight cannot be decreased) Upgrading an edge corresponds to decreasing the weight of that particular edge, and there is a cost associated with such an upgrade. The goal is to obtain an ....
O. Berman, Improving the location of minisum facilities through network modification, Annals of Operations Research 40 (1992), 1--16.
Upgrading Bottleneck Constrained Forests - Krumke, Marathe, Noltemeier.. (Correct)
....as opposed to network reconstruction problems, are convenient for investigating such cases where the cost of implementing a computed network from scratch exceeds the cost of modifying an already installed network. There are two main models for network upgrading problems: the edge upgrading model [Ber92, Phi93, KN 96] where upgrading an edge reduces the delay on the upgraded edge, and the node upgrading model [PS95, KM 97] where upgrading a node reduces the delay on all edges incident with the upgraded node. In communication networks, upgrading a node corresponds to installing faster ....
O. Berman, Improving the location of minisum facilities through network modification, Annals of Operations Research 40 (1992), 1--16.
Upgrading Bottleneck Constrained Forests - Krumke, Marathe, Noltemeier.. (Correct)
....as opposed to network reconstruction problems, are convenient for investigating such cases where the cost of implementing a computed network from scratch exceeds the cost of modifying an already installed network. There are two main models for network upgrading problems: the edge upgrading model [Ber92, Phi93, KN 96] where upgrading an edge reduces the delay on the upgraded edge, and the node upgrading model [PS95, KM 97] where upgrading a node reduces the delay on all edges incident with the upgraded node. In communication networks, upgrading a node corresponds to installing faster ....
O. Berman, Improving the location of minisum facilities through network modification, Annals of Operations Research 40 (1992), 1--16.
Improving Minimum Cost Spanning Trees by Upgrading Nodes - Krumke, Marathe.. (1997) (Correct)
.... namely the bottleneck weight of a minimum bottleneck spanning tree, leads to the problem (NODE UPGRADING COST, BOTTLENECK WEIGHT, SPANNING TREE) This bottleneck problem has been investigated in [KM 97] 4 Edge based network upgrading problems have also been considered in the literature [Ber92, KN 96b, KN 96a] There, each edge has a current weight and a minimum weight (below which the edge weight cannot be decreased) Upgrading an edge corresponds to decreasing the weight of that particular edge, and there is a cost associated with such an upgrade. The goal is to obtain an ....
O. Berman, Improving the location of minisum facilities through network modification, Annals of Operations Research 40 (1992), 1--16.
Approximation Algorithms for Certain Network Improvement Problems - Krumke, al. (1998) (3 citations) (Correct)
....in a graph subject to a budget constraint where the cost functions are assumed to be linear in the weight increase. In contrast to the results presented here, they show that while the integral 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 ....
....polynomial algorithms for special classes such as in trees and series parallel graphs. Phillips [19] studies the problem of nding an optimal strategy for reducing the capacity of a given network so that the residual capacity in the modi ed network is minimized. The problems studied here and in [19, 2] can be broadly classi ed as types of bicriteria problems. Recently, there has been substantial work on nding ecient approximation algorithms for a variety of bicriteria problems (see [15, 11, 18, 25, 24, 26] and the references cited therein) Some node upgrading problems have been studied under ....
O. Berman, Improving the location of minisum facilities through network modication, Annals of Operations Research 40 (1992), pp. 1-16.
Improving Spanning Trees by Upgrading Nodes - Krumke, Marathe, Noltemeier.. (1997) (Correct)
....series parallel graphs) rather than on the development of approximation algorithms. Our constructions can be modified to show that all the problems considered here remain NP hard even under the Paik Sahni model. Edge based network upgrading problems have also been considered in the literature [1, 4, 5]. There, each edge has a current weight and a minimum weight (below which the edge weight cannot be decreased) Upgrading an edge corresponds to decreasing the weight of that particular edge and there is a cost associated with such an upgrade. The goal is to obtain an upgraded network with the ....
O. Berman, "Improving The Location of Minisum Facilities Through Network Modification," Annals of Operations Research, Vol. 40, 1992, pp. 1--16.
Node Weighted Network Upgrade Problems (Extended Abstract) - Krumke, Noltemeier.. (1997) (Correct)
....the problem of increasing the weight of the minimum spanning tree in a graph subject to a budget constraint where the cost functions are assumed to be linear in the weight increase. In contrast to the work presented here, they showed that the problem is solvable in strongly polynomial time. Berman [3] considers the problem of shortening edges in a given tree to minimize its shortest path tree weight and shows that the problem can be solved in polynomial time by a greedy algorithm. Phillips [25] studies the problem of finding an optimal strategy for reducing the capacity of the network so ....
O. Berman, "Improving The Location of Minisum Facilities Through Network Modification, " Annals of Operations Research, 40(1992), pp. 1--16.
Modifying Networks to Obtain Low Cost Trees - Krumke, Noltemeier, Marathe.. (1996) (1 citation) (Correct)
....not been previously studied. Recently in an independent effort Frederickson and Solis Oba [FS96] considered the problem of increasing the weight of the minimum spanning tree in a graph subject to a budget constraint where the cost functions are assumed to be linear in the weight increase. Berman [Be92] considers the problem of shortening edges in a given tree to minimize its shortest path tree weight. In contrast to the work presented here, this problem is shown to be solvable in strongly polynomial time. Phillips [Ph93] studies the problem of finding an optimal strategy for reducing the ....
....presented here, this problem is shown to be solvable in strongly polynomial time. Phillips [Ph93] studies the problem of finding an optimal strategy for reducing the capacity of the network so that the residual capacity in the modified network is minimized. The problems studied here and in [Ph93, Be92] can be broadly classified as types of bicriteria problems. Recently, there has been substantial work on finding efficient approximation algorithms for a variety of bicriteria problems (see [KP95, Ha92, MRS 95, RR 93, Ra94, Wa92, ZPD94] and the references therein) v 1 ; v 2 ) v 2 ; v 4 ) ....
O. Berman, "Improving The Location of Minisum Facilities Through Network Modification," Annals of Operations Research, 40(1992), pp. 1--16.
Approximation Algorithms for Certain Network Improvement Problems - al. (1998) (3 citations) (Correct)
....in a graph subject to a budget constraint where the cost functions are assumed to be linear in the weight increase. In contrast to the results presented here, they show that while the integral 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 ....
....polynomial algorithms for special classes such as in trees and series parallel graphs. Phillips [19] studies the problem of finding an optimal strategy for reducing the capacity of a given network so that the residual capacity in the modified network is minimized. The problems studied here and in [19, 2] can be broadly classified as types of bicriteria problems. Recently, there has been substantial work on finding efficient approximation algorithms for a variety of bicriteria problems (see [15, 11, 18, 25, 24, 26] and the references cited therein) Some node upgrading problems have been studied ....
O. Berman, Improving the location of minisum facilities through network modification, Annals of Operations Research 40 (1992), pp. 1--16.
Improving Steiner Trees of a Network Under Multiple Constraints .. - Krumke, al. (1997) (Correct)
....weight of the minimum spanning tree in a graph subject to a budget constraint where the cost functions are assumed to be linear in the weight increase. In contrast to the work presented here, this problem turns out to be much easier and is shown to be solvable in strongly polynomial time. Berman [3] considers the problem of shortening edges in a given tree to minimize its shortest path tree weight. This problem is solvable in polynomial time by a straightforward greedy algorithm. Phillips [28] studies the problem of finding an optimal strategy for reducing the capacity of the network so that ....
....weight. This problem is solvable in polynomial time by a straightforward greedy algorithm. Phillips [28] studies the problem of finding an optimal strategy for reducing the capacity of the network so that the residual capacity in the modified network is minimized. The problems studied here and in [28, 3] can be broadly classified as types of multicriteria problems. Recently, there has been substantial work on finding efficient approximation algorithms for a variety of bicriteria problems (see [21, 18, 27, 29, 30, 31, 32] and the references therein) 4 Approximation Algorithm for Dia BCST Problem ....
O. Berman, "Improving The Location of Minisum Facilities Through Network Modification, " Annals of Operations Research, 40(1992), pp. 1--16.
Multiple Hotlink Assignment - Fuhrmann, Krumke, Wirth (2001) (3 citations) (Correct)
No context found.
O. Berman Improving the location of minisum facilities through network modi cation Annals of Operations Research 40 (1992), 1-16.
Improving Spanning Trees by Upgrading Nodes - Krumke, Marathe, Noltemeir.. (1997) (Correct)
No context found.
#Ber92# O. Berman, Improving the location of minisum facilities through network modi#cation, Annals of Operations Research
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