334 search results - page 2 / 67 » Approximation Algorithms for Non-Uniform Buy-at-Bulk Network... |
DSN
2008
IEEE
14 years 1 days ago
2008
IEEE
Quorums are a basic construct in solving many fundamental distributed computing problems. One of the known ways of making quorums scalable and efficient is by weakening their int...
NCA
2008
IEEE
13 years 5 months ago
2008
IEEE
WADS
2009
Springer
14 years 4 days ago
2009
Springer
Abstract. The buy-at-bulk network design problem has been extensively studied in the general graph model. In this paper we consider the geometric version of the problem, where all ...
EWSN
2011
Springer
12 years 9 months ago
2011
Springer
Highly efficient compression provides a promising approach to address the transmission and computation challenges imposed by moving object tracking applications on resource constra...
OL
2008
13 years 5 months ago
2008
Building on an existing 2-approximate algorithm for the class of network design problems with downwards-monotone demand functions, many of which are NP-hard, we present an algorith...