• Corpus ID: 18292372

Up- and downgrading the 1-median in a network

  title={Up- and downgrading the 1-median in a network},
  author={Elisabeth Gassner},
While classical location problems deal with finding optimal locations for facilities, the task of the corresponding upgrading (downgrading) version is to change the underlying network within certain bounds such that the optimal objective value that can be obtained in the modified network is as good (bad) as possible. In this paper we allow to change the vertex weights within given bounds such that a linear budget constraint is satisfied. For the upgrading 1-median problem an O(n) time algorithm… 

Figures from this paper

Up- and downgrading the euclidean 1-median problem and knapsack Voronoi diagrams
The upgrading problem is shown to belong to the family of continuous single facility location-allocation problems, whereas the downgrading problem reduces to a convex but highly non-differentiable optimization problem.
Optimal approaches for upgrading selective obnoxious p-median location problems on tree networks
It is shown that if the bound constraints are dropped, then the problems under investigation can be solved in lower times, and exact optimal algorithms with polynomial time complexities are developed.
A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric
A game-theoretic view at the Downgrading 1-median problem leads to a characterization of an optimal solution and implies an $\mathcal {O}(n\log^{2}n)$ time algorithm for this problem.
Upgrading p-Median Problem on a Path
A polynomial-time model to address the problem of finding the best median of the given graph through modification of its parameters when the weights of vertices can be varying under a given budget is developed.


An Algorithmic Approach to Network Location Problems. II: The p-Medians
An algorithm is presented which finds a p-median of a tree (for $p > 1$) in time $O(n^2 \cdot p^2 )$.
Approximation Algorithms for Certain Network Improvement Problems
A brief overview of the models and definitions of the various problems considered are provided and several new results on the complexity and approximability of network improvement problems are presented.
A Network Improvement Problem Under Different Norms
This paper considers a network improvement problem, called vertex-to-vertices distance reduction problem, and presents a strongly polynomial algorithm to solve the problem and shows that achieving an approximation ratio O(log(|V|)) is NP-hard.
A linear time algorithm for the reverse 1‐median problem on a cycle
This article deals with the reverse 1‐median problem on graphs with positive vertex weights. The problem is proved to be strongly NP‐hard even in the case of bipartite graphs and not approximable
Optimal Center Location in Simple Networks
In this paper, simple one-pass solution algorithms are given for two classes of topologically simple networks, namely those which are either acyclic or contain exactly one cycle.
Inapproximability and a polynomially solvable special case of a network improvement problem