109 search results - page 17 / 22 » An Approximation Algorithm for Shortest Descending Paths |
133
Voted
INFOCOM
2011
IEEE
14 years 3 months ago
2011
IEEE
—We formulate the problem of delay constrained energy-efficient broadcast in cooperative multihop wireless networks. We show that this important problem is not only NPcomplete, ...
119
click to vote
SODA
1992
ACM
15 years 25 days ago
1992
ACM
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...
102
click to vote
SIROCCO
2001
15 years 1 months ago
2001
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...
100
click to vote
MOBIHOC
2005
ACM
15 years 11 months ago
2005
ACM
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
TIP
1998
14 years 11 months ago
1998
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...