Sciweavers

268 search results - page 18 / 54
» Facility location: distributed approximation
Sort
View
EDBT
2008
ACM
95views Database» more  EDBT 2008»
14 years 8 months ago
Zerber: r-confidential indexing for distributed documents
To carry out work assignments, small groups distributed within a larger enterprise often need to share documents among themselves while shielding those documents from others'...
Sergej Zerr, Elena Demidova, Daniel Olmedilla, Wol...
PODC
2006
ACM
14 years 1 months ago
Object location using path separators
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
Ittai Abraham, Cyril Gavoille
TCS
2010
13 years 6 months ago
Randomized priority algorithms
Borodin, Nielsen and Rackoff [13] introduced the class of priority algorithms as a framework for modeling deterministic greedy-like algorithms. In this paper we address the effe...
Spyros Angelopoulos, Allan Borodin
ESA
2008
Springer
108views Algorithms» more  ESA 2008»
13 years 9 months ago
Two-Stage Robust Network Design with Exponential Scenarios
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, ...
TMC
2010
152views more  TMC 2010»
13 years 6 months ago
On Multihop Distances in Wireless Sensor Networks with Random Node Locations
—Location and intersensor distance estimations are important functions for the operation of wireless sensor networks, especially when protocols can benefit from the distance info...
Serdar Vural, Eylem Ekici