The following pages link to (Q5417667):
Displayed 34 items.
- Search-space size in contraction hierarchies (Q306264) (← links)
- Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs (Q666662) (← links)
- On the VC-dimension of unique round-trip shortest path systems (Q1730015) (← links)
- A simple ant colony optimizer for stochastic shortest path problems (Q1945168) (← links)
- \(\mathsf{W[1]}\)-hardness of the \(k\)-center problem parameterized by the skeleton dimension (Q2084642) (← links)
- The parameterized hardness of the \(k\)-center problem in transportation networks (Q2182096) (← links)
- Polynomial time approximation schemes for clustering in low highway dimension graphs (Q2229951) (← links)
- Sublinear search spaces for shortest path planning in grid and road networks (Q2230730) (← links)
- Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs (Q2402262) (← links)
- Maintaining Shortest Paths Under Deletions in Weighted Directed Graphs (Q2805514) (← links)
- Candidate Sets for Alternative Routes in Road Networks (Q2828197) (← links)
- User-Constrained Multimodal Route Planning (Q2828200) (← links)
- Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates (Q2828206) (← links)
- On the Complexity of Hub Labeling (Extended Abstract) (Q2946377) (← links)
- VC-Dimension and Shortest Path Algorithms (Q3012843) (← links)
- A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs (Q3448808) (← links)
- Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs (Q3449507) (← links)
- Lower Bounds in the Preprocessing and Query Phases of Routing Algorithms (Q3452861) (← links)
- A Metric on Directed Graphs and Markov Chains Based on Hitting Probabilities (Q4999367) (← links)
- Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension (Q5009565) (← links)
- A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels (Q5042258) (← links)
- Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics (Q5089179) (← links)
- An Experimental Study of the Treewidth of Real-World Graph Data (Q5091123) (← links)
- (Q5092347) (← links)
- The Parameterized Hardness of the k-Center Problem in Transportation Networks (Q5116483) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
- Customizable Contraction Hierarchies (Q5266613) (← links)
- A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs (Q5376438) (← links)
- (Q5743390) (← links)
- On Hop-Constrained Steiner Trees in Tree-Like Metrics (Q5864216) (← links)
- (Q5874487) (← links)
- (Q5874516) (← links)
- Travelling on graphs with small highway dimension (Q5925522) (← links)
- Generalized \(k\)-center: distinguishing doubling and highway dimension (Q6043186) (← links)