654 search results - page 1 / 131 » An efficient approximation algorithm for the survivable netw... |
108
Voted
IPCO
1993
15 years 2 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...
106
Voted
INFOCOM
2009
IEEE
15 years 7 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...
111
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
107
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
2009
IEEE
: Given a logical topology and a physical topology , the survivable logical topology design problem in an IP-overWDM optical network is to map the logical links into lightpaths in ...
91
Voted
JAL
2002
15 years 22 days ago
2002
The element connectivity problem falls in the category of survivable network design problems { it is intermediate to the versions that ask for edge-disjoint and vertex-disjoint pa...