41 search results - page 2 / 9 » Shortest Descending Paths through Given Faces |
WINE
2010
Springer
13 years 2 months ago
2010
Springer
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may...
INFOCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
— In this paper, we analyze the impact of straight line routing in large homogeneous multi-hop wireless networks. We estimate the nodal load, which is defined as the number of p...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...
SSD
2005
Springer
13 years 10 months ago
2005
Springer
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
WWW
2004
ACM
14 years 5 months ago
2004
ACM
In this paper, we present a localized Shortest Path Tree (SPT) based algorithm for constructing a sub-network with the minimum-energy property for a given wireless ad hoc network....