Sciweavers

1091 search results - page 13 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
NETWORKS
2006
14 years 9 months ago
Approximation algorithms for channel allocation problems in broadcast networks
We study two packing problems that arise in the area of dissemination-based information systems; a second theme is the study of distributed approximation algorithms. The problems c...
Rajiv Gandhi, Samir Khuller, Aravind Srinivasan, N...
ICPP
2008
IEEE
15 years 3 months ago
A List-Based Strategy for Optimal Replica Placement in Data Grid Systems
—Data replications is a typical strategy for improving access performance and data availability in Data Grid systems. Current works on data replication in Grid systems focus on t...
Yi-Fang Lin, Jan-Jan Wu, Pangfeng Liu
INFOCOM
2006
IEEE
15 years 3 months ago
Relay Placement for Higher Order Connectivity in Wireless Sensor Networks
Abstract— Sensors typically use wireless transmitters to communicate with each other. However, sensors may be located in a way that they cannot even form a connected network (e.g...
Abhishek Kashyap, Samir Khuller, Mark A. Shayman
SODA
2004
ACM
161views Algorithms» more  SODA 2004»
14 years 11 months ago
Approximation schemes for Metric Bisection and partitioning
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
Wenceslas Fernandez de la Vega, Marek Karpinski, C...
CDC
2008
IEEE
15 years 4 months ago
Simultaneous placement and assignment for exploration in mobile backbone networks
Abstract— This paper presents new algorithms for conducting cooperative sensing using a mobile backbone network. This hierarchical sensing approach combines backbone nodes, which...
Emily M. Craparo, Jonathan P. How, Eytan Modiano