Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Shortest-path queries in static networks - MaRDI portal

Shortest-path queries in static networks (Q5176178)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 6410354

Language	Label	Description	Also known as
English	Shortest-path queries in static networks	scientific article; zbMATH DE number 6410354

Statements

scholarly article

0 references

Shortest-path queries in static networks (English)

0 references

Christian Sommer

0 references

ACM Computing Surveys

0 references

publication date

2 March 2015

0 references

zbMATH Keywords

shortest path

0 references

shortest-path query

0 references

distance oracle

0 references

describes a project that uses

0 references

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1145/2530531

0 references

0 references

VC-Dimension and Shortest Path Algorithms

0 references

Hierarchical Hub Labelings for Shortest Paths

0 references

0 references

Object location using path separators

0 references

On Approximate Distance Labels and Routing Schemes with Affine Stretch

0 references

Compact name-independent routing with minimum stretch

0 references

On the bias of traceroute sampling

0 references

A random graph model for massive graphs

0 references

Reachability is harder for directed than for undirected finite graphs

0 references

The Use of Wye-Delta Transformations in Network Simplification

0 references

A Separator Theorem for Nonplanar Graphs

0 references

Planar spanners and approximate shortest path queries among obstacles in the plane

0 references

Near-Linear Time Construction of Sparse Neighborhood Covers

0 references

Algorithms for Hub Label Optimization

0 references

0 references

0 references

Fast Routing in Road Networks with Transit Nodes

0 references

Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error

0 references

Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs

0 references

Approximate distance oracles for unweighted graphs in expected <i>O</i> ( <i>n</i> <sup>2</sup> ) time

0 references

Preprocessing Speed-Up Techniques Is Hard

0 references

Search-Space Size in Contraction Hierarchies

0 references

The Shortcut Problem – Complexity and Approximation

0 references

0 references

Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm

0 references

Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected

0 references

On Lipschitz embedding of finite metric spaces in Hilbert space

0 references

0 references

Many distances in planar graphs

0 references

Multiple-Source Shortest Paths in Embedded Graphs

0 references

Approximate distance oracles with constant query time

0 references

Shortest path queries in planar graphs

0 references

A compact routing scheme and approximate distance oracle for power-law graphs

0 references

Shortest paths algorithms: Theory and experimental evaluation

0 references

The average distances in random graphs with given expected degrees

0 references

Power-Law Distributions in Empirical Data

0 references

Fast Algorithms for Constructing t-Spanners and Paths with Stretch t

0 references

Reachability and Distance Queries via 2-Hop Labels

0 references

On the Shortest Route Through a Network

0 references

0 references

Engineering Route Planning Algorithms

0 references

0 references

Shortest-path algorithms: Taxonomy and annotation

0 references

A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees

0 references

A note on two problems in connexion with graphs

0 references

Approximate Distance Queries for Weighted Polyhedral Surfaces

0 references

All-Pairs Almost Shortest Paths

0 references

An Appraisal of Some Shortest-Path Algorithms

0 references

Subgraph Isomorphism in Planar Graphs and Related Problems

0 references

Planar graphs, negative weight edges, shortest paths, and near linear time

0 references

Relaxing the uniformity and independence assumptions using the concept of fractal dimension

0 references

The Cascade Algorithm for Finding all Shortest Distances in a Directed Graph

0 references

0 references

Fast Algorithms for Shortest Paths in Planar Graphs, with Applications

0 references

Heuristic shortest path algorithms for transportation applications: state of the art

0 references

Reoptimization procedures in shortest path problem

0 references

Distance labeling in graphs

0 references

Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks

0 references

A separator theorem for graphs of bounded genus

0 references

Point-to-Point Shortest Path Algorithms with Preprocessing

0 references

0 references

0 references

Technical Note—Shortest-Path Algorithms: A Comparison

0 references

0 references

Fast Construction of Nets in Low-Dimensional Metrics and Their Applications

0 references

Faster shortest-path algorithms for planar graphs

0 references

Engineering multilevel overlay graphs for shortest-path queries

0 references

Combining speed-up techniques for shortest-path computations

0 references

Approximate Shortest Path Queries Using Voronoi Duals

0 references

A Decomposition Algorithm for Shortest Paths in a Network

0 references

0 references

Shortcut in the Decomposition Algorithm for Shortest Paths in a Network

0 references

Improved algorithms for min cut and max flow in undirected planar graphs

0 references

Efficient Algorithms for Shortest Paths in Sparse Networks

0 references

Implicat Representation of Graphs

0 references

Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs

0 references

A “String Algorithm” for Shortest Path in Directed Networks

0 references

0 references

0 references

Structured recursive separator decompositions for planar graphs in linear time

0 references

Shortest paths in directed planar graphs with negative lengths

0 references

A fully dynamic approximation scheme for shortest paths in planar graphs

0 references

The small-world phenomenon

0 references

Triangulation and embedding using small sets of beacons

0 references

Experimental and Efficient Algorithms

0 references

Oracles for bounded-length shortest paths in planar graphs

0 references

\(BS^*:\) An admissible bidirectional staged heuristic search algorithm

0 references

The Extension of the Cascade Algorithm to Large Graphs

0 references

Generalized Nested Dissection

0 references

A Separator Theorem for Planar Graphs

0 references

On the distortion required for embedding finite metric spaces into normed spaces

0 references

Goal-directed shortest-path queries using precomputed cluster distances

0 references

Algorithms and Data Structures

0 references

Ramsey partitions and proximity data structures

0 references

0 references

A Decomposition Algorithm for the Shortest-Route Problem

0 references

Partitioning graphs to speedup Dijkstra's algorithm

0 references

Fast and Compact Oracles for Approximate Distances in Planar Graphs

0 references

Linear time low tree-width partitions and algorithmic consequences

0 references

Finding the Shortest Route between Two Points in a Network

0 references

Improved Distance Queries in Planar Graphs

0 references

Implementation and efficiency of Moore-algorithms for the shortest route problem

0 references

Unifying the Landscape of Cell-Probe Lower Bounds

0 references

Proximity-preserving labeling schemes

0 references

0 references

Solutions of the Shortest-Route Problem—A Review

0 references

Preprocess, set, query!

0 references

0 references

Automata, Languages and Programming

0 references

Algorithms – ESA 2005

0 references

Engineering Highway Hierarchies

0 references

All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings

0 references

0 references

Shortest paths in Euclidean graphs

0 references

Approximating Shortest Paths in Graphs

0 references

Distance Oracles for Sparse Graphs

0 references

Compact oracles for reachability and approximate distances in planar digraphs

0 references

Approximate distance oracles

0 references

A Theorem on Planar Graphs

0 references

Algorithms - ESA 2003

0 references

Speed-Up Techniques for Shortest-Path Computations

0 references

Geometric containers for efficient shortest-path computation

0 references

A Theorem on Boolean Matrices

0 references

Computing the dilation of edge-augmented graphs in metric spaces

0 references

Should Tables Be Sorted?

0 references

Shortest Path Algorithms: An Evaluation Using Real Road Networks

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1145/2530531

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5176178

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5176178&oldid=35441779"