2421 search results - page 4 / 485 » Approximate Flow-Aware Networking |
TIT
2011
14 years 4 months ago
2011
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
OL
2008
14 years 9 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...
TCOM
2011
14 years 4 months ago
2011
Abstract—We consider decode-and-forward cooperative networks and we derive analytical expressions as well as tractable asymptotic approximations for the outage probability of a n...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Given a graph with edge costs, the power of a node is the maximum cost of an edge incident to it, and the power of a graph is the sum of the powers of its nodes. Motivated by appli...
SIAMCOMP
2010
14 years 4 months ago
2010
The (undirected) Steiner Network problem is: given a graph = ( , ) with edge/node-weights and edge-connectivity requirements { ( , ) : , }, find a minimumweight subgraph of conta...