Sciweavers

217 search results - page 23 / 44
» Approximating Minimum Manhattan Networks
Sort
View
FOCS
2000
IEEE
14 years 2 months ago
Hierarchical Placement and Network Design Problems
In this paper, we give the first constant-approximations for a number of layered network design problems. We begin by modeling hierarchical caching, where caches are placed in la...
Sudipto Guha, Adam Meyerson, Kamesh Munagala
DCOSS
2008
Springer
13 years 11 months ago
Improving the Data Delivery Latency in Sensor Networks with Controlled Mobility
Unlike traditional multihop forwarding among homogeneous static sensor nodes, use of mobile devices for data collection in wireless sensor networks has recently been gathering more...
Ryo Sugihara, Rajesh K. Gupta
AINA
2005
IEEE
14 years 3 months ago
Dynamical Construction of a Core-Based Group-Shared Multicast Tree in Mobile Ad Hoc Networks
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
Bing-Hong Liu, Ming-Jer Tsai, Wei-Chei Ko
ICALP
2005
Springer
14 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...
CIAC
2006
Springer
103views Algorithms» more  CIAC 2006»
14 years 1 months ago
Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
Friedrich Eisenbrand, Edda Happ