Approximation algorithms for the airport and railway problem
From MaRDI portal
Cites work
- A (1+\varepsilon)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
- A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering
- A note on LP-based approximation algorithms for capacitated facility location problem
- A PTAS for Capacitated Vehicle Routing on Trees
- Airports and railways: facility location meets network design
- Approximating airports and railways
- Approximation algorithms for a facility location problem with service capacities
- Approximation Algorithms for Problems Combining Facility Location and Network Design
- Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
- Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension
- Bypassing the embedding
- scientific article; zbMATH DE number 6297716 (Why is no real title available?)
- Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
- Improved approximations for capacitated vehicle routing with unsplittable client demands
- Improving the approximation ratio for capacitated vehicle routing
- Matroid Intersection
- New approximation algorithms for the minimum cycle cover problem
- Parallel Algorithms with Optimal Speedup for Bounded Treewidth
- Planar and minor-free metrics embed into metrics of polylogarithmic treewidth with expected multiplicative distortion arbitrarily close to 1
This page was built for publication: Approximation algorithms for the airport and railway problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891102)
