973 search results - page 162 / 195 » New Bounds on Crossing Numbers |
AHSWN
2008
13 years 8 months ago
2008
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
COR
2010
13 years 8 months ago
2010
: In this paper, we study a new variant of the vehicle routing problem (VRP) with time windows, multi-shift, and overtime. In this problem, a limited fleet of vehicles is used repe...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We consider the problem of securing a multicast network against a wiretapper that can intercept the packets on a limited number of arbitrary network links of his choice. We assume ...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We consider the problem of rate allocation in a Gaussian multiple-access channel, with the goal of maximizing a utility function over transmission rates. In contrast to the literat...
DAM
2008
13 years 8 months ago
2008
Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) pre...