Approximation Algorithms for Metric Facility Location Problems
From MaRDI portal
Publication:3434992
Recommendations
- scientific article; zbMATH DE number 1947060
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- scientific article; zbMATH DE number 2086926
- scientific article; zbMATH DE number 1559542
- scientific article; zbMATH DE number 1187151
Cited in
(91)- A primal-dual approximation algorithm for stochastic facility location problem with service installation costs
- LP-based approximation algorithms for capacitated facility location
- A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation
- A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties
- Approximating the two-level facility location problem via a quasi-greedy approach
- scientific article; zbMATH DE number 2159272 (Why is no real title available?)
- Capacitated Domination Problem
- An exact cooperative method for the uncapacitated facility location problem
- An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem
- Automata, Languages and Programming
- Approximation algorithm for facility location with service installation costs
- Cost-effective designs of fault-tolerant access networks in communication systems
- scientific article; zbMATH DE number 1947043 (Why is no real title available?)
- Approximating \(k\)-median via pseudo-approximation
- Beyond Moulin mechanisms
- Approximation algorithms for the stochastic priority facility location problem
- Approximation algorithms for the metric labeling problem via a new linear programming formulation
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- Approximation algorithms for soft-capacitated facility location in capacitated network design
- A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
- Fast bounding procedures for large instances of the simple plant location problem
- An improved per-scenario bound for the two-stage stochastic facility location problem
- A new approximation algorithm for the multilevel facility location problem
- Approximation of the competitive facility location problem with MIPs
- Deterministic sampling algorithms for network design
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Soft-capacitated facility location game
- An approximation algorithm for the stochastic fault-tolerant facility location problem
- Improved approximation algorithms for the robust fault-tolerant facility location problem
- Approximation algorithms for the fault-tolerant facility location problem with penalties
- An approximation algorithm for the dynamic facility location problem with submodular penalties
- Approximation algorithm for uniform bounded facility location problem
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- A cross-monotonic cost sharing method for the facility location game with service installation costs
- scientific article; zbMATH DE number 2086926 (Why is no real title available?)
- A primal-dual approximation algorithm for the facility location problem with submodular penalties
- Improved approximation algorithms for the facility location problems with linear/submodular penalties
- Complexity and approximability of optimal resource allocation and Nash equilibrium over networks
- A cost-sharing method for the multi-level economic lot-sizing game
- Black-box reductions for cost-sharing mechanism design
- Integrating facility location and production planning decisions
- Approximation algorithm for resource allocation problems with time dependent penalties
- A cost-sharing method for an economic lot-sizing game
- An approximation algorithm for the risk-adjusted two-stage stochastic facility location problem with penalties
- A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem
- Integrality gaps for strengthened linear relaxations of capacitated facility location
- Robust fault tolerant uncapacitated facility location
- scientific article; zbMATH DE number 1947060 (Why is no real title available?)
- Approximation algorithms for the transportation problem with market choice and related models
- Approximation algorithms for the fault-tolerant facility placement problem
- scientific article; zbMATH DE number 1670526 (Why is no real title available?)
- Fault-tolerant concave facility location problem with uniform requirements
- An approximation algorithm for the maximization version of the two level uncapacitated facility location problem
- The online prize-collecting facility location problem
- Approximating the two-level facility location problem via a quasi-greedy approach
- A distributed O(1)-approximation algorithm for the uniform facility location problem
- A mixed integer programming formulation and solution for traffic analysis zone delineation considering zone amount decision
- A cost-sharing method for an uncapacitated facility location game with penalties
- An approximation algorithm for the \(k\)-level stochastic facility location problem
- Capacitated domination problem
- An approximation algorithm for the \(k\)-level capacitated facility location problem
- Improved approximation algorithms for multilevel facility location problems
- An approximation algorithm for soft capacitated \(k\)-facility location problem
- An approximation algorithm for the soft-capacitated dynamic facility location problem
- Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach
- Recovery guarantees for exemplar-based clustering
- An approximation algorithm for the dynamic facility location problem with outliers
- Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems
- Improved approximation algorithms for constrained fault-tolerant resource allocation
- A combinatorial approximation algorithm for \(k\)-level facility location problem with submodular penalties
- scientific article; zbMATH DE number 2079337 (Why is no real title available?)
- Approximation algorithms for a facility location problem with service capacities
- A per-scenario bound for the two-stage stochastic facility location problem with linear penalty
- The approximation gap for the metric facility location problem is not yet closed
- Entrepreneurship facility-activation games
- A local search approximation algorithm for a squared metric \(k\)-facility location problem
- Approximation algorithms for the fault-tolerant facility location problem with submodular penalties
- Improved lower bound for differentially private facility location
- Approximating the \(\tau\)-relaxed soft capacitated facility location problem
- Approximating soft-capacitated facility location problem with uncertainty
- Approximation algorithm for the uniform bounded facility problem
- Approximation algorithms for stochastic and risk-averse optimization
- Metric location problems with nonshortest service routes
- An approximation algorithm for the \(n\)th power metric facility location problem with linear penalties
- LP-rounding approximation algorithms for two-stage stochastic fault-tolerant facility location problem
- Dynamic sum-radii clustering
- Black-box reductions for cost-sharing mechanism design
- Mixed fault tolerance in server assignment: combining reinforcement and backup
- Approximation algorithms for minimum-load \(k\)-facility location
- The facility location problem with maximum distance constraint
- Approximation algorithms for minimum-load \(k\)-facility location
This page was built for publication: Approximation Algorithms for Metric Facility Location Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3434992)
