A combinatorial approximation algorithm for k-level facility location problem with submodular penalties
From MaRDI portal
Publication:6176404
Recommendations
- A combinatorial 2.375-approximation algorithm for the facility location problem with submodular penalties
- A primal-dual approximation algorithm for the facility location problem with submodular penalties
- Approximation algorithms for the priority facility location problem with submodular penalties
- Improved approximation algorithms for the facility location problems with linear/submodular penalties
- Improved approximation algorithms for the facility location problems with linear/submodular penalty
Cites work
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- scientific article; zbMATH DE number 2086926 (Why is no real title available?)
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- A combinatorial 2.375-approximation algorithm for the facility location problem with submodular penalties
- A new approximation algorithm for the \(k\)-facility location problem
- Algorithms for facility location problems with outliers. (Extended abstract)
- An approximation algorithm for \(k\)-facility location problem with linear penalties using local search scheme
- An approximation algorithm for the \(k\)-level facility location problem with submodular penalties
- An improved approximation algorithm for uncapacitated facility location problem with penalties
- Approximation Algorithms for Metric Facility Location Problems
- Approximation Algorithms for the Multilevel Facility Location Problem with Linear/Submodular Penalties
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- Improved Combinatorial Algorithms for Facility Location Problems
- Improved LP-rounding approximation algorithm for \(k\)-level uncapacitated facility location
- Improved approximation algorithms for solving the squared metric \(k\)-facility location problem
- Improved approximation algorithms for the facility location problems with linear/submodular penalties
- Inapproximability of the multi-level uncapacitated facility location problem
- Network design for information networks
- Submodular functions and optimization.
Cited in
(16)- A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties
- Algorithm for \(k\)-product facility location problem with submodular penalties
- A combinatorial 2.375-approximation algorithm for the facility location problem with submodular penalties
- Improved approximation algorithm for \(k\)-level UFL with penalties, a simplistic view on randomizing the scaling parameter
- An approximation algorithm for the warehouse-retailer network design problem with submodular penalties
- Approximation algorithms for the priority facility location problem with submodular penalties
- scientific article; zbMATH DE number 2038706 (Why is no real title available?)
- Improved approximation algorithms for the facility location problems with linear/submodular penalties
- An approximation algorithm for the \(k\)-level facility location problem with submodular penalties
- Approximation algorithms for the dynamic \(k\)-level facility location problems
- A primal-dual 3-approximation algorithm for the stochastic facility location problem with submodular penalties
- The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
- An approximate cost recovery scheme for the \(k\)-product facility location game with penalties
- Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization
- Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach
This page was built for publication: A combinatorial approximation algorithm for \(k\)-level facility location problem with submodular penalties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6176404)
