Facility location, distributed approximation
From MaRDI portal
(Redirected from Publication:5177232)
Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Approximation algorithms (68W25) Continuous location (90B85) Linear programming (90C05)
Recommendations
- Return of the primal-dual, distributed metric facility location
- A distributed O(1)-approximation algorithm for the uniform facility location problem
- Sub-logarithmic distributed algorithms for metric facility location
- Super-fast distributed algorithms for metric facility location
- A distributed approximation algorithm for fault-tolerant metric facility location
Cited in
(12)- Simultaneous siting and sizing of distribution centers on a plane
- Fast primal-dual distributed algorithms for scheduling and matching problems
- MapReduce based location selection algorithm for utility maximization with capacity constraints
- Super-fast distributed algorithms for metric facility location
- Location of distribution centers in a multi-period collaborative distribution network
- LARGE-SCALE SINGLE FACILITY CONTINUOUS LOCATION BY D.C. OPTIMIZATION
- Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree
- Return of the primal-dual, distributed metric facility location
- A distributed O(1)-approximation algorithm for the uniform facility location problem
- Sub-logarithmic distributed algorithms for metric facility location
- Lessons from the congested clique applied to MapReduce
- Kinetic facility location
This page was built for publication: Facility location, distributed approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5177232)
