scientific article; zbMATH DE number 1947062
From MaRDI portal
Publication:4411292
Recommendations
- Primal-dual algorithms for connected facility location problems
- Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
- A 6.55 factor primal-dual approximation algorithm for the connected facility location problem
- Approximation algorithms for connected facility location problems
- A primal-dual approximation algorithm for the facility location problem with submodular penalties
- Dual-based local search for the connected facility location and related problems
- Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
- scientific article; zbMATH DE number 3885614
- Improved Approximation Algorithm for Connected Facility Location Problems
- Approximate the lower-bounded connected facility location problem
Cited in
(13)- Construction Line Algorithms for the Connection Location-Allocation Problem
- On the parameterized complexity of reconfiguration of connected dominating sets
- A 6.55 factor primal-dual approximation algorithm for the connected facility location problem
- Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
- Securely connected facility location in metric graphs
- Cross-monotonic cost sharing methods for connected facility location games
- A branch and cut algorithm for hub location problems with single assignment
- Improved Approximation Algorithm for Connected Facility Location Problems
- Primal-dual algorithms for connected facility location problems
- Contention-aware data caching in wireless multi-hop ad hoc networks
- Connected facility location via random facility sampling and core detouring
- Dual-based local search for the connected facility location and related problems
- Approximation algorithms for connected facility location problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4411292)