909 search results - page 104 / 182 » On the approximability of some network design problems |
163
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—We study in this paper optimal stochastic control issues in delay tolerant networks. We first derive the structure of optimal two-hop forwarding policies. In order to be implem...
152
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
157
click to vote
NETWORKING
2000
15 years 7 months ago
2000
Abstract. We examine the fair allocation of capacity to a large population of best-effort connections in a typical multiple access communication system supporting some bandwidth on...
174
click to vote
CSCW
2008
ACM
15 years 8 months ago
2008
ACM
Social networks are popular for online communities. This paper evaluates the risk of sophisticated context-aware spam that could result from information sharing on social networks...
203
click to vote
DIALM
2000
ACM
15 years 10 months ago
2000
ACM
The allocation of scarce spectral resources to support as many user applications as possible while maintaining reasonable quality of service is a fundamental problem in wireless c...