Sciweavers

15 search results - page 3 / 3
» A Polynomial-Time Approximation Scheme for Euclidean Steiner...
Sort
View
SIAMCOMP
2008
108views more  SIAMCOMP 2008»
13 years 3 months ago
The Euclidean Orienteering Problem Revisited
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
Ke Chen 0006, Sariel Har-Peled
ICALP
2005
Springer
13 years 9 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...
ESA
2003
Springer
98views Algorithms» more  ESA 2003»
13 years 8 months ago
Network Lifetime and Power Assignment in ad hoc Wireless Networks
In ad-hoc wireless networks, certain network connectivity constraints are of interest because of their practical importance. An example of such a constraint would be strong connec...
Gruia Calinescu, Sanjiv Kapoor, Alexander Olshevsk...
DCOSS
2006
Springer
13 years 7 months ago
GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Rav...
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
13 years 10 months ago
Shifting Strategy for Geometric Graphs without Geometry
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
Imran A. Pirwani