909 search results - page 3 / 182 » On the approximability of some network design problems |
155
click to vote
WEA
2005
Springer
16 years 5 hour ago
2005
Springer
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
170
click to vote
IJSNET
2007
15 years 6 months ago
2007
Abstract: Wireless sensor networks are often based on omni-sensing and communication models. In contrast, in this paper, we investigate sensor networks with directional sensing and...
164
click to vote
OL
2008
15 years 6 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...
177
click to vote
IPCO
1993
15 years 7 months ago
1993
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximati...
155
click to vote
SIAMDM
2008
15 years 6 months ago
2008
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary o...