Sciweavers

763 search results - page 104 / 153
» Engineering Shortest Path Algorithms
Sort
View
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
13 years 10 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson
ADHOC
2007
121views more  ADHOC 2007»
13 years 9 months ago
Power-aware single- and multipath geographic routing in sensor networks
Nodes in a sensor network, operating on power limited batteries, must save power to minimize the need for battery replacement. We note that the range of transmission has a signi...
Shibo Wu, K. Selçuk Candan
INFOCOM
2012
IEEE
12 years 2 days ago
On exploiting flow allocation with rate adaptation for green networking
Abstract—Network power consumption can be reduced considerably by adapting link data rates to their offered traffic loads. In this paper, we exploit how to leverage rate adaptat...
Jian Tang, Brendan Mumey, Yun Xing, Andy Johnson
GIS
2006
ACM
14 years 10 months ago
Distance join queries on spatial networks
The result of a distance join operation on two sets of objects R, S on a spatial network G is a set P of object pairs <p, q>, p R, q S such that the distance of an object ...
Jagan Sankaranarayanan, Houman Alborzi, Hanan Same...
STOC
2004
ACM
110views Algorithms» more  STOC 2004»
14 years 10 months ago
On sums of independent random variables with unbounded variance, and estimating the average degree in a graph
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
Uriel Feige