Sciweavers

9 search results - page 2 / 2
» A polylogarithmic approximation for computing non-metric ter...
Sort
View
COR
2007
108views more  COR 2007»
14 years 9 months ago
New primal-dual algorithms for Steiner tree problems
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
Vardges Melkonian
ICALP
2005
Springer
15 years 3 months ago
Stochastic Steiner Trees Without a Root
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...
Anupam Gupta, Martin Pál
TPDS
2008
136views more  TPDS 2008»
14 years 9 months ago
Data Gathering with Tunable Compression in Sensor Networks
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
Yang Yu, Bhaskar Krishnamachari, Viktor K. Prasann...
ICALP
2005
Springer
15 years 3 months ago
New Approaches for Virtual Private Network Design
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo...