Recent advances in fully dynamic graph algorithms–a quick reference guide
In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …
dynamic algorithms. However, these theoretical results have received very little attention …
Internet traffic engineering by optimizing OSPF weights
Open shortest path first (OSPF) is the most commonly used intra-domain Internet routing
protocol. Traffic flow is routed along shortest paths, splitting flow at nodes where several …
protocol. Traffic flow is routed along shortest paths, splitting flow at nodes where several …
Fast replanning for navigation in unknown terrain
S Koenig, M Likhachev - IEEE transactions on robotics, 2005 - ieeexplore.ieee.org
Mobile robots often operate in domains that are only incompletely known, for example, when
they have to move from given start coordinates to given goal coordinates in unknown terrain …
they have to move from given start coordinates to given goal coordinates in unknown terrain …
Recent advances in fully dynamic graph algorithms
In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …
dynamic algorithms. However, these theoretical results have received very little attention …
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In
this paper, we study how to answer queries of finding the best departure time that minimizes …
this paper, we study how to answer queries of finding the best departure time that minimizes …
[PDF][PDF] Adaptive fastest path computation on a road network: a traffic mining approach
H Gonzalez, J Han, X Li, M Myslinska… - Proceedings of the 33rd …, 2007 - vldb.org
Efficient fastest path computation in the presence of varying speed conditions on a large
scale road network is an essential problem in modern navigation systems. Factors affecting …
scale road network is an essential problem in modern navigation systems. Factors affecting …
Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs
V King - 40th Annual Symposium on Foundations of Computer …, 1999 - ieeexplore.ieee.org
This paper presents the first fully dynamic algorithms for maintaining all-pairs shortest paths
in digraphs with positive integer weights less than b. For approximate shortest paths with an …
in digraphs with positive integer weights less than b. For approximate shortest paths with an …
Increasing internet capacity using local search
Abstract Open Shortest Path First (OSPF) is one of the most commonly used intra-domain
internet routing protocol. Traffic flow is routed along shortest paths, splitting flow evenly at …
internet routing protocol. Traffic flow is routed along shortest paths, splitting flow evenly at …
Spatial big-data challenges intersecting mobility and cloud computing
Increasingly, location-aware datasets are of a size, variety, and update rate that exceeds the
capability of spatial computing technologies. This paper addresses the emerging challenges …
capability of spatial computing technologies. This paper addresses the emerging challenges …
Fully dynamic algorithms for maintaining shortest paths trees
We propose fully dynamic algorithms for maintaining the distances and the shortest paths
from a single source in either a directed or an undirected graph with positive real edge …
from a single source in either a directed or an undirected graph with positive real edge …