Approximating Airports and Railways
From MaRDI portal
Publication:3304099
DOI10.4230/LIPICS.STACS.2018.5zbMath1487.68254OpenAlexW2790034418MaRDI QIDQ3304099
Anna Adamaszek, Antonios Foivos Antoniadis, Tobias Mömke, Amit Kumar
Publication date: 5 August 2020
Full work available at URL: https://doi.org/10.4230/LIPIcs.STACS.2018.5
Deterministic network models in operations research (90B10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Discrete location and assignment (90B80) Approximation algorithms (68W25)
Related Items (2)
Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center ⋮ Airports and railways with unsplittable demand
Cites Work
- Unnamed Item
- New approximation algorithms for the unsplittable capacitated facility location problem
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
- Approximation Schemes for Capacitated Geometric Network Design
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Approximation Algorithms for Problems Combining Facility Location and Network Design
- Airports and Railways: Facility Location Meets Network Design
- Approximation algorithms for a facility location problem with service capacities
This page was built for publication: Approximating Airports and Railways
