scientific article; zbMATH DE number 6297747
From MaRDI portal
Publication:5417667
zbMath1288.68243MaRDI QIDQ5417667
Renato F. Werneck, Andrew V. Goldberg, Ittai Abraham, Amos Fiat
Publication date: 22 May 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Traffic problems in operations research (90B20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (34)
A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels ⋮ 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 ⋮ Search-space size in contraction hierarchies ⋮ Lower Bounds in the Preprocessing and Query Phases of Routing Algorithms ⋮ Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs ⋮ The parameterized hardness of the \(k\)-center problem in transportation networks ⋮ On the Complexity of Hub Labeling (Extended Abstract) ⋮ Generalized \(k\)-center: distinguishing doubling and highway dimension ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A simple ant colony optimizer for stochastic shortest path problems ⋮ A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs ⋮ On the VC-dimension of unique round-trip shortest path systems ⋮ Polynomial time approximation schemes for clustering in low highway dimension graphs ⋮ Sublinear search spaces for shortest path planning in grid and road networks ⋮ Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs ⋮ Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension ⋮ VC-Dimension and Shortest Path Algorithms ⋮ Shortest-path queries in static networks ⋮ Unnamed Item ⋮ Maintaining Shortest Paths Under Deletions in Weighted Directed Graphs ⋮ Travelling on graphs with small highway dimension ⋮ Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics ⋮ An Experimental Study of the Treewidth of Real-World Graph Data ⋮ 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 ⋮ A Metric on Directed Graphs and Markov Chains Based on Hitting Probabilities ⋮ \(\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 ⋮ Unnamed Item ⋮ On Hop-Constrained Steiner Trees in Tree-Like Metrics ⋮ Customizable Contraction Hierarchies
This page was built for publication:
