Results 1 
5 of
5
Minimizing broadcast costs under edge reductions in tree networks
 In 7th International Symposium on Spatial and Temporal Databases (SSTD 2001
, 2001
"... ..."
(Show Context)
Improving Spanning Trees by Upgrading Nodes
 PROCEEDINGS OF THE 24TH INTERNATIONAL COLLOQUIUM ON AUTOMATA, LANGUAGES AND PROGRAMMING (ICALP'97
, 1997
"... We study bottleneck constrained network upgrading problems.We are given an edge weighted graph G =(V;E) where node v 2 V can be upgraded at a cost of c(v). This upgrade reduces the delayofeach link emanating from v. The goal is to #nd a minimum cost set of nodes to be upgraded so that the resulting ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
We study bottleneck constrained network upgrading problems.We are given an edge weighted graph G =(V;E) where node v 2 V can be upgraded at a cost of c(v). This upgrade reduces the delayofeach link emanating from v. The goal is to #nd a minimum cost set of nodes to be upgraded so that the resulting network has a good performance. The performance is measured by the bottleneckweightof a minimum spanning tree. We give a polynomial time appoximation algorithm with logarithmic performance guarantee, which is tight within a small constant factor as shown by our hardness results.
On BudgetConstrained Flow Improvement
, 1998
"... This paper investigates the complexity of budgetconstrained flow improvement problems. We are given a directed graph with capacities on the edges which can be increased at linear costs up to some upper bounds. The problem is to increase the capacities within budget restrictions such that the flow ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
This paper investigates the complexity of budgetconstrained flow improvement problems. We are given a directed graph with capacities on the edges which can be increased at linear costs up to some upper bounds. The problem is to increase the capacities within budget restrictions such that the flow from the source to the sink vertex is maximized. We show that the problem can be solved in polynomial time even if the improvement strategy is required to be integral. On the other hand, if the capacity of an edge must either be increased to the upper bound or left unchanged, then the problem turns NPhard even on seriesparallel graphs and strongly NPhard on bipartite graphs. For the class seriesparallel graphs we provide a fully polynomial approximation scheme for this problem.
Improving minimum cost spanning trees by upgrading nodes
 Journal of Algorithms
, 1999
"... * A preliminary version of this paper appeared as KM 97. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
* A preliminary version of this paper appeared as KM 97.
Downgrading the 1median in the plane with Manhattan metric
, 2008
"... This paper deals with changing parameters of the 1median problem in the plane with Manhattan metric within certain bounds such that the optimal objective value of the 1median problem with respect to the new values of the parameters is maximized. An O(n log 2 n) time algorithm is suggested that is ..."
Abstract
 Add to MetaCart
(Show Context)
This paper deals with changing parameters of the 1median problem in the plane with Manhattan metric within certain bounds such that the optimal objective value of the 1median problem with respect to the new values of the parameters is maximized. An O(n log 2 n) time algorithm is suggested that is mainly based on a fast search and prune procedure.