193 search results - page 17 / 39 » A Lower Bound for the Shortest Path Problem |
HICSS
2008
IEEE
15 years 6 months ago
2008
IEEE
A transposition is an operation that exchanges two adjacent substrings. When it is restricted so that one of the substrings is a prefix, it is called a prefix transposition. The p...
100
click to vote
JSAC
2006
14 years 11 months ago
2006
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
COMCOM
2000
14 years 11 months ago
2000
The new Path Length Control (PLC) algorithm establishes and maintains multicast trees which maximize the bandwidth to be shared by multiple receivers and which satisfy the maximum...
195
click to vote
INFOCOM
2011
IEEE
14 years 3 months ago
2011
IEEE
—It is well-known that the application of directional antennas can help conserve bandwidth and energy consumption in wireless networks. Thus, to achieve efficiency in wireless n...
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...