410 search results - page 2 / 82 » Upgrading Shortest Paths in Networks |
NETWORKS
2000
14 years 9 months ago
2000
NETWORKS
2006
14 years 9 months ago
2006
105
click to vote
ESA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
EJC
2008
14 years 9 months ago
2008
We provide bounds for the product of the lengths of distinguished shortest paths in a finite network induced by a triangulation of a topological planar quadrilateral.
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...