581 search results - page 37 / 117 » Approximation algorithms for constructing wavelength routing... |
157
click to vote
COCOON
2008
Springer
15 years 7 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
160
click to vote
JSAC
2006
15 years 6 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...
160
click to vote
IWCMC
2006
ACM
15 years 12 months ago
2006
ACM
One important characteristic of wireless sensor networks is energy stringency. Constructing a connected dominating set (CDS) has been widely used as a topology control strategy to...
144
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
A recent seminal result of R?acke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, R?ack...
160
click to vote
MASCOTS
2010
15 years 7 months ago
2010
In this paper, we address the problem of low-latency routing in a vehicular highway network. To cover long highways while minimizing the number of required roadside access points,...