scientific article; zbMATH DE number 5734726
From MaRDI portal
Publication:3574266
Recommendations
- Shortest-path queries in static networks
- Quickest path queries on transportation network
- Fast Routing in Road Networks with Transit Nodes
- Efficient single-pair all-shortest-path query processing for massive dynamic networks
- Faster shortest paths in dense distance graphs, with applications
- Algorithms – ESA 2005
- Faster distributed shortest path approximations via shortcuts
Cited in
(15)- Efficient single-pair all-shortest-path query processing for massive dynamic networks
- The parameterized hardness of the \(k\)-center problem in transportation networks
- Quickest path queries on transportation network
- A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
- Fixed parameter approximations for \(k\)-center problems in low highway dimension graphs
- Robust, almost constant time shortest-path queries in road networks
- Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension
- Exploiting hopsets: improved distance oracles for graphs of constant highway dimension and beyond
- The parameterized hardness of the \(k\)-center problem in transportation networks
- Transit nodes -- lower bounds and refined construction
- A (1+\varepsilon)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
- Generating node coordinates for shortest-path computations in transportation networks
- Travelling on graphs with small highway dimension
- Reconfiguring shortest paths in graphs
- Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3574266)
