Pages that link to "Item:Q3012843"
From MaRDI portal
The following pages link to VC-Dimension and Shortest Path Algorithms (Q3012843):
Displayed 21 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)
- Fast approximation of betweenness centrality through sampling (Q1741154) (← 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)
- Candidate Sets for Alternative Routes in Road Networks (Q2828197) (← links)
- On the Complexity of Hub Labeling (Extended Abstract) (Q2946377) (← 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)
- Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension (Q5009565) (← links)
- Computing Constrained Shortest-Paths at Scale (Q5031006) (← links)
- (Q5092347) (← links)
- The Parameterized Hardness of the k-Center Problem in Transportation Networks (Q5116483) (← links)
- Shortest-path queries in static networks (Q5176178) (← 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)
- Travelling on graphs with small highway dimension (Q5925522) (← links)