Pages that link to "Item:Q5111697"
From MaRDI portal
The following pages link to A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs (Q5111697):
Displaying 3 items.
- Improved approximations for capacitated vehicle routing with unsplittable client demands (Q2164702) (← links)
- Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension (Q5009565) (← links)
- Stronger ILPs for the Graph Genus Problem. (Q5075767) (← links)
