Approximating airports and railways
From MaRDI portal
Publication:3304099
DOI10.4230/LIPICS.STACS.2018.5zbMATH Open1487.68254OpenAlexW2790034418MaRDI QIDQ3304099FDOQ3304099
Authors: Anna Adamaszek, Antonios Foivos Antoniadis, Amit Kumar, Tobias Mömke 
Publication date: 5 August 2020
Full work available at URL: https://doi.org/10.4230/LIPIcs.STACS.2018.5
Recommendations
- Airports and railways: facility location meets network design
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Approximation algorithms for a facility location problem with service capacities
- Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
- Automata, Languages and Programming
Deterministic network models in operations research (90B10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Discrete location and assignment (90B80)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- New approximation algorithms for the unsplittable capacitated facility location problem
- 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 geometric network design
- Approximation algorithms for a facility location problem with service capacities
- Airports and railways: facility location meets network design
Cited In (3)
This page was built for publication: Approximating airports and railways
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3304099)
