Pages that link to "Item:Q5009565"
From MaRDI portal
The following pages link to Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension (Q5009565):
Displaying 12 items.
- 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)
- \(\mathsf{W[1]}\)-hardness of the \(k\)-center problem parameterized by the skeleton dimension (Q2084642) (← links)
- A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering (Q2118143) (← links)
- Improved approximations for capacitated vehicle routing with unsplittable client demands (Q2164702) (← 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)
- Computing Constrained Shortest-Paths at Scale (Q5031006) (← links)
- A Fast $$(2 + 2/7)$$-Approximation Algorithm for Capacitated Cycle Covering (Q5041760) (← links)
- Improving the approximation ratio for capacitated vehicle routing (Q5918417) (← links)
- Travelling on graphs with small highway dimension (Q5925522) (← links)
- Improving the approximation ratio for capacitated vehicle routing (Q5925635) (← links)
