The hub labels (HL) algorithm is the fastest known technique for computing driving times on road networks, but its practical appli-cability can be limited by high space requirements relative to the best competing methods. We develop compression techniques that substantially reduce HL space requirements with a small performance penalty
Abstract. Server based route planning in road networks is now powerful enough to find quickest paths...
In the shortest path problem we have a weighted graph, a source vertex and a target vertex as an inp...
Positioning data are usually acquired periodically and uploaded to the server via wireless network i...
Abstract. The Hub Labeling algorithm (HL) is an exact shortest path algorithm with excellent query p...
Landmark-based routing and Hub Labeling (HL) are shortest path planning techniques, both of which re...
Finding shortest paths in a Euclidean plane containing polygonal obstacles is a well-studied problem...
International audienceAbstract: Segment Routing is a new architecture that leverages the source rout...
International audienceA distance labeling scheme is an assignment of bit-labels to the vertices of a...
Many modern applications deal with multi-label data such as functional categorizations of genes, ima...
Rural areas are the geographical areas that are located far away from the cities and there are many ...
Most people-centric delay tolerant networks have been shown to exhibit power-law behavior. Analysis ...
One of the viable solutions for reducing congestion in networks is data compression. Data compressio...
Answering point-to-point distance queries is important in many applications, including games, roboti...
The essential elements of any navigation system are a shortest-path algorithm and a map dataset. Whe...
Abstract—Road-network data compression reduces the size of the network to occupy lesser storage with...
Abstract. Server based route planning in road networks is now powerful enough to find quickest paths...
In the shortest path problem we have a weighted graph, a source vertex and a target vertex as an inp...
Positioning data are usually acquired periodically and uploaded to the server via wireless network i...
Abstract. The Hub Labeling algorithm (HL) is an exact shortest path algorithm with excellent query p...
Landmark-based routing and Hub Labeling (HL) are shortest path planning techniques, both of which re...
Finding shortest paths in a Euclidean plane containing polygonal obstacles is a well-studied problem...
International audienceAbstract: Segment Routing is a new architecture that leverages the source rout...
International audienceA distance labeling scheme is an assignment of bit-labels to the vertices of a...
Many modern applications deal with multi-label data such as functional categorizations of genes, ima...
Rural areas are the geographical areas that are located far away from the cities and there are many ...
Most people-centric delay tolerant networks have been shown to exhibit power-law behavior. Analysis ...
One of the viable solutions for reducing congestion in networks is data compression. Data compressio...
Answering point-to-point distance queries is important in many applications, including games, roboti...
The essential elements of any navigation system are a shortest-path algorithm and a map dataset. Whe...
Abstract—Road-network data compression reduces the size of the network to occupy lesser storage with...
Abstract. Server based route planning in road networks is now powerful enough to find quickest paths...
In the shortest path problem we have a weighted graph, a source vertex and a target vertex as an inp...
Positioning data are usually acquired periodically and uploaded to the server via wireless network i...
DOI
Add to ORKG