Publication:5417667
From MaRDI portal
zbMath1288.68243MaRDI QIDQ5417667
Renato F. Werneck, Andrew V. Goldberg, Ittai Abraham, Amos Fiat
Publication date: 22 May 2014
68W05: Nonnumerical algorithms
68R10: Graph theory (including graph drawing) in computer science
90B20: Traffic problems in operations research
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Unnamed Item, A Metric on Directed Graphs and Markov Chains Based on Hitting Probabilities, A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels, Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension, Shortest-path queries in static networks, Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics, An Experimental Study of the Treewidth of Real-World Graph Data, The Parameterized Hardness of the k-Center Problem in Transportation Networks, Customizable Contraction Hierarchies, A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs, Unnamed Item, Unnamed Item, Unnamed Item, Travelling on graphs with small highway dimension, On Hop-Constrained Steiner Trees in Tree-Like Metrics, Generalized \(k\)-center: distinguishing doubling and highway dimension, Search-space size in contraction hierarchies, Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs, On the VC-dimension of unique round-trip shortest path systems, A simple ant colony optimizer for stochastic shortest path problems, \(\mathsf{W[1}\)-hardness of the \(k\)-center problem parameterized by the skeleton dimension], The parameterized hardness of the \(k\)-center problem in transportation networks, Polynomial time approximation schemes for clustering in low highway dimension graphs, Sublinear search spaces for shortest path planning in grid and road networks, Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs, Maintaining Shortest Paths Under Deletions in Weighted Directed Graphs, Candidate Sets for Alternative Routes in Road Networks, User-Constrained Multimodal Route Planning, Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates, On the Complexity of Hub Labeling (Extended Abstract), VC-Dimension and Shortest Path Algorithms, 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, Lower Bounds in the Preprocessing and Query Phases of Routing Algorithms
