Sciweavers

625 search results - page 69 / 125
» Routing in Trees
Sort
View
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
14 years 7 months ago
Approximability of Robust Network Design
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
Neil Olver, F. Bruce Shepherd
MDM
2007
Springer
195views Communications» more  MDM 2007»
14 years 4 months ago
BORA: Routing and Aggregation for Distributed Processing of Spatio-Temporal Range Queries
This work tackles the problem of answer-aggregation for continuous spatio-temporal range queries in distributed settings. We assume a grid-like coverage of the spatial universe of...
Goce Trajcevski, Hui Ding, Peter Scheuermann, Isab...
ALENEX
2001
101views Algorithms» more  ALENEX 2001»
13 years 11 months ago
CNOP - A Package for Constrained Network Optimization
Abstract. We present a generic package for resource constrained network optimization problems. We illustrate the flexibility and the use of our package by solving four applications...
Kurt Mehlhorn, Mark Ziegelmann
ADHOC
2006
155views more  ADHOC 2006»
13 years 10 months ago
Application versus network layer multicasting in ad hoc networks: the ALMA routing protocol
Application layer multicasting has emerged as an appealing alternative to network layer multicasting in wireline networks. Here, we examine the suitability of application layer mu...
Min Ge, Srikanth V. Krishnamurthy, Michalis Falout...
VLDB
2005
ACM
226views Database» more  VLDB 2005»
14 years 3 months ago
BATON: A Balanced Tree Structure for Peer-to-Peer Networks
We propose a balanced tree structure overlay on a peer-to-peer network capable of supporting both exact queries and range queries efficiently. In spite of the tree structure caus...
H. V. Jagadish, Beng Chin Ooi, Quang Hieu Vu