109 search results - page 20 / 22 » An Approximation Algorithm for Shortest Descending Paths |
WADS
2007
Springer
15 years 3 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
3DPVT
2006
IEEE
15 years 3 months ago
2006
IEEE
Building footprints have been shown to be extremely useful in urban planning, infrastructure development, and roof modeling. Current methods for creating these footprints are ofte...
144
click to vote
INFOCOM
2011
IEEE
14 years 1 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...
INFOCOM
2012
IEEE
12 years 12 months ago
2012
IEEE
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...
83
Voted
CIC
2004
14 years 11 months ago
2004
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...