Abstract. We generalize the Cost-Distance problem: Given a set of sites in-dimensional Euclidean space and a weighting over pairs of sites, construct a network that minimizes the cost (i.e. weight) of the network and the weighted distances between all pairs of sites. It turns out that the optimal solution can contain Steiner points as well as cycles. Furthermore, there are instances where crossings optimize the network. We then investigate how trees can approximate the weighted Cost-Distance problem. We show that for any given set of sites and a non-negative weighting of pairs, provided the sum of the weights is polynomial, one can construct in polynomial time a tree that approximates the optimal network within a factor of. Finally, we show...
Cette thèse porte sur différents problèmes d'optimisation combinatoire dont nous avons caractérisé l...
In this paper, we consider the Uniform Cost-Distance Steiner Tree Problem in metric spaces, a genera...
We consider a class of network-design problems with minimum sum of modification and network costs fo...
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanni...
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanni...
We study the problem of finding the optimal connection between two disconnected vertex-weighted tree...
A Deterministic Algorithm for the COST-DISTANCE Problem The COST-DISTANCE network design problem is ...
The COST-DISTANCE network design problem is the following. We are given an undirected graph G = (V,E...
We study the following network design problem: Given a communication network, find a minimum cost su...
We give the first approximation algorithm for the generalized network Steiner problem, a problem in ...
[[abstract]]Given an undirected graph with nonnegative edge lengths and nonnegative vertex weights, ...
Uniform cost-distance Steiner trees minimize the sum of the total length and weighted path lengths f...
The problem of designing a communication network for a given set of requirements has been studied ex...
We study network-design problems with two different design objectives: the total cost of the edges a...
Abstract. We give the first approximation algorithm for the generalized network Steiner problem, a p...
Cette thèse porte sur différents problèmes d'optimisation combinatoire dont nous avons caractérisé l...
In this paper, we consider the Uniform Cost-Distance Steiner Tree Problem in metric spaces, a genera...
We consider a class of network-design problems with minimum sum of modification and network costs fo...
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanni...
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanni...
We study the problem of finding the optimal connection between two disconnected vertex-weighted tree...
A Deterministic Algorithm for the COST-DISTANCE Problem The COST-DISTANCE network design problem is ...
The COST-DISTANCE network design problem is the following. We are given an undirected graph G = (V,E...
We study the following network design problem: Given a communication network, find a minimum cost su...
We give the first approximation algorithm for the generalized network Steiner problem, a problem in ...
[[abstract]]Given an undirected graph with nonnegative edge lengths and nonnegative vertex weights, ...
Uniform cost-distance Steiner trees minimize the sum of the total length and weighted path lengths f...
The problem of designing a communication network for a given set of requirements has been studied ex...
We study network-design problems with two different design objectives: the total cost of the edges a...
Abstract. We give the first approximation algorithm for the generalized network Steiner problem, a p...
Cette thèse porte sur différents problèmes d'optimisation combinatoire dont nous avons caractérisé l...
In this paper, we consider the Uniform Cost-Distance Steiner Tree Problem in metric spaces, a genera...
We consider a class of network-design problems with minimum sum of modification and network costs fo...