1941 search results - page 49 / 389 » On Generalizations of Network Design Problems with Degree Bo... |
174
click to vote
SIAMDM
2010
15 years 24 days ago
2010
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
254
click to vote
AINA
2004
IEEE
15 years 9 months ago
2004
IEEE
In this paper, we propose a personal navigation system (called PNS) which navigates a tourist through multiple destinations efficiently. In our PNS, a tourist can specify multiple...
160
click to vote
ETFA
2006
IEEE
16 years 3 days ago
2006
IEEE
In this paper, the effect of network-induced delay introduced into the control loop is modelled as time-varying disturbance. Based on this model, a fault isolation filter (FIF) f...
160
click to vote
STOC
2006
ACM
16 years 17 hour ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
148
click to vote
INFOCOM
2007
IEEE
16 years 11 days ago
2007
IEEE
Abstract— Data aggregation is a fundamental yet timeconsuming task in wireless sensor networks. We focus on the latency part of data aggregation. Previously, the data aggregation...