570 search results - page 14 / 114 » Approximating Some Network Design Problems with Node Costs |
107
click to vote
FOCS
2000
IEEE
15 years 5 months ago
2000
IEEE
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...
105
click to vote
EVOW
2008
Springer
15 years 3 months ago
2008
Springer
The bi-objective ring star problem aims to locate a cycle through a subset of nodes of a graph while optimizing two types of cost. The first criterion is to minimize a ring cost, r...
147
click to vote
ENTCS
2007
15 years 1 months ago
2007
Designing secure protocols over ad-hoc networks has proved to be a very challenging task, due to various features of such networks, such as partial connectivity, node mobility, an...
110
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
—With the explosive deployment of “triple play” (voice, video and data services) over the same access network, guaranteeing a certain-level of survivability for the access ne...
134
click to vote
IAT
2009
IEEE
15 years 8 months ago
2009
IEEE
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....