Pages that link to "Item:Q5875536"
From MaRDI portal
The following pages link to Hierarchy of Transportation Network Parameters and Hardness Results (Q5875536):
Displaying 8 items.
- \(\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)
- Computing \(L(p, 1)\)-labeling with combined parameters (Q2232248) (← links)
- Computing L(p,1)-Labeling with Combined Parameters (Q5049996) (← links)
- (Q5874516) (← links)
- Travelling on graphs with small highway dimension (Q5925522) (← links)