126 search results - page 13 / 26 » Resource-Constrained Geometric Network Optimization |
SODA
2000
ACM
13 years 10 months ago
2000
ACM
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
IV
2007
IEEE
14 years 2 months ago
2007
IEEE
We consider routing methods for networks when geographic positions of nodes are available. Instead of using the original geographic coordinates, however, we precompute virtual coo...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
—This paper formally establishes that random access scheduling schemes, and, more specifically CSMA-CA, yields exceptionally good performance in the context of wireless multihop...
ALGOSENSORS
2009
Springer
14 years 3 months ago
2009
Springer
We study scenarios where mobile hubs are charged with building a communication bridge between two given points s and t. We introduce a new bi-criteria optimization problem where th...
NOMS
2008
IEEE
14 years 3 months ago
2008
IEEE
—In this paper∗ , we devise a novel method for bottleneck analysis of UDP networks based on the concept of network utility maximization. To determine the losses on the links in...