581 search results - page 18 / 117 » Approximation algorithms for constructing wavelength routing... |
124
click to vote
SODA
1998
ACM
15 years 2 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
120
click to vote
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
—The notion of p-cycle (Preconfigured Protection Cycle) allows capacity efficient schemes to be designed for fast span protection in WDM mesh networks. Conventional p-cycle const...
129
click to vote
CCCG
2010
15 years 2 months ago
2010
A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...
112
click to vote
INFOCOM
2000
IEEE
15 years 5 months ago
2000
IEEE
— We study wavelength assignment for lightpaths over WDM rings to minimize the SONET ADMs used. This problem has attracted much attention recently. However, its computation compl...
136
click to vote
GLOBECOM
2007
IEEE
15 years 5 months ago
2007
IEEE
Recently, cooperative routing in wireless networks has gained much interest due to its ability to exploit the broadcast nature of the wireless medium in designing powerefficient ro...