Robust facility leasing problem with penalties
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- A primal-dual approximation algorithm for the facility location problem with submodular penalties
- A semi brute-force search approach for (balanced) clustering
- Algorithms for facility location problems with outliers. (Extended abstract)
- An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
- An approximation algorithm for diversity-aware fair \(k\)-supplier problem
- An improved approximation algorithm for uncapacitated facility location problem with penalties
- Approximating k-median via pseudo-approximation
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Approximation algorithms for the individually fair k-center with outliers
- Combinatorial approximation algorithms for the robust facility location problem with penalties
- Greedy Strikes Back: Improved Facility Location Algorithms
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Improved Combinatorial Algorithms for Facility Location Problems
- Improved approximation algorithms for the facility location problems with linear/submodular penalty
- Infrastructure Leasing Problems
- Offline and online facility leasing
This page was built for publication: Robust facility leasing problem with penalties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6989686)
