An improved approximation algorithm for uncapacitated facility location problem with penalties
From MaRDI portal
Recommendations
- Computing and Combinatorics
- Improved approximation algorithm for k-level uncapacitated facility location problem (with penalties)
- An Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem with Penalties
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- scientific article; zbMATH DE number 1187151
- scientific article; zbMATH DE number 2086926
- An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
- Improved approximation algorithm for universal facility location problem with linear penalties
- An LP-rounding based algorithm for a uniform capacitated facility location problem with penalties
- scientific article; zbMATH DE number 1342123
Cites work
- A constant factor approximation algorithm for the fault-tolerant facility location problem
- Algorithms for facility location problems with outliers. (Extended abstract)
- An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
- Approximating the two-level facility location problem via a quasi-greedy approach
- 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
- Greedy Strikes Back: Improved Facility Location Algorithms
- scientific article; zbMATH DE number 1303535 (Why is no real title available?)
- scientific article; zbMATH DE number 1305496 (Why is no real title available?)
- scientific article; zbMATH DE number 1342123 (Why is no real title available?)
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- Local search heuristic for k-median and facility location problems
Cited in
(46)- An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
- An improved branch \& bound method for the uncapacitated competitive location problem
- Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions
- A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties
- An LP-rounding based algorithm for a uniform capacitated facility location problem with penalties
- An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties
- Concave connection cost facility location and the star inventory routing problem
- An approximation algorithm for the \(n\)th power metric facility location problem with linear penalties
- Approximation algorithm for uniform bounded facility location problem
- Approximation algorithms for the fault-tolerant facility location problem with penalties
- Improved approximation algorithm for universal facility location problem with linear penalties
- A primal-dual approximation algorithm for the facility location problem with submodular penalties
- Improved approximation algorithm for k-level uncapacitated facility location problem (with penalties)
- Combinatorial approximation algorithms for the robust facility location problem with penalties
- Approximation Algorithms for the Robust Facility Location Problem with Penalties
- Approximation algorithm for the uniform bounded facility problem
- Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- scientific article; zbMATH DE number 5811147 (Why is no real title available?)
- The online prize-collecting facility location problem
- A $$(5.83+\epsilon )$$ ( 5.83 + ϵ ) -Approximation Algorithm for Universal Facility Location Problem with Linear Penalties
- An Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem with Penalties
- scientific article; zbMATH DE number 1187151 (Why is no real title available?)
- An approximation algorithm for the risk-adjusted two-stage stochastic facility location problem with penalties
- An approximation algorithm for the dynamic facility location problem with submodular penalties
- Approximation algorithm for resource allocation problems with time dependent penalties
- A cost-sharing method for an uncapacitated facility location game with penalties
- Local search algorithm for universal facility location problem with linear penalties
- A per-scenario bound for the two-stage stochastic facility location problem with linear penalty
- scientific article; zbMATH DE number 6263680 (Why is no real title available?)
- Computing and Combinatorics
- Supply chain management with online customer selection
- Approximation algorithms for prize-collecting capacitated network design problems
- The facility location problem with maximum distance constraint
- New formulations for two location problems with interconnected facilities
- A combinatorial approximation algorithm for \(k\)-level facility location problem with submodular penalties
- Algorithm for \(k\)-product facility location problem with submodular penalties
- Local search yields a PTAS for fixed-dimensional k-means problem with penalties
- Approximation algorithm for k-product uncapacitated facility location problem with submodular penalties
- A polynomial-time exact algorithm for the connected k-facility location problem on trees
- Uniform capacitated facility location with outliers/penalties
- Robust facility leasing problem with penalties
- An LP-rounding based algorithm for soft capacitated facility location problem with submodular penalties
- An LP-rounding based algorithm for hard capacitated uniform facility location problem with soft penalties
- Improved approximation algorithms for the facility location problems with linear/submodular penalties
- Approximation algorithms for the priority facility location problem with penalties
This page was built for publication: An improved approximation algorithm for uncapacitated facility location problem with penalties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1029272)