Securely connected facility location in metric graphs
From MaRDI portal
Recommendations
- Approximation algorithms for connected facility location problems
- Improved Approximation Algorithm for Connected Facility Location Problems
- Connected facility location via random facility sampling and core detouring
- scientific article; zbMATH DE number 1947062
- Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
Cites work
- An exact algorithm for solving the ring star problem
- An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem
- scientific article; zbMATH DE number 5764866 (Why is no real title available?)
- scientific article; zbMATH DE number 2150800 (Why is no real title available?)
- scientific article; zbMATH DE number 1405785 (Why is no real title available?)
- Minimum-weight two-connected spanning networks
- On the relationship between the biconnectivity augmentation and traveling salesman problems
- The Ring Star Problem: Polyhedral analysis and exact algorithm
Cited in
(6)- A 6.55 factor primal-dual approximation algorithm for the connected facility location problem
- Median and covering location problems with interconnected facilities
- A PTAS for the geometric connected facility location problem
- Dual-based local search for the connected facility location and related problems
- scientific article; zbMATH DE number 1163715 (Why is no real title available?)
- Disjoint-path facility location: theory and practice
This page was built for publication: Securely connected facility location in metric graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5232830)