Greedy Strikes Back: Improved Facility Location Algorithms
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Easy capacitated facility location problems, with connections to lot-sizing
- On Min-Max r-Gatherings
- New algorithms for fair \(k\)-center problem with outliers and capacity constraints
- Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics
- An approximation algorithm for the dynamic facility location problem with submodular penalties
- Robust network function virtualization
- Improved approximation algorithm for fault-tolerant facility placement
- Greedy algorithms for the single-demand facility location problem
- Improved approximation algorithm for k-level uncapacitated facility location problem (with penalties)
- Approximation algorithms for the fault-tolerant facility placement problem
- Approximating \(k\)-hop minimum spanning trees in Euclidean metrics
- The facility location problem with general cost functions
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- An approximation algorithm for the k-level capacitated facility location problem
- A General k-Level Uncapacitated Facility Location Problem
- The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem
- Local search approximation algorithms for the sum of squares facility location problems
- An approximation algorithm for k-level squared metric facility location problem with outliers
- A \(k\)-product uncapacitated facility location problem
- Approximation algorithms for continuous clustering and facility location problems
- Fault-tolerant concave facility location problem with uniform requirements
- Kinetic facility location
- The General Steiner Tree-Star problem.
- Improved approximation algorithms for solving the squared metric k-facility location problem
- Iterative partial rounding for vertex cover with hard capacities
- An approximation algorithm for the \(n\)th power metric facility location problem with linear penalties
- Approximation algorithm for squared metric facility location problem with nonuniform capacities
- Approximation algorithm for the k-product uncapacitated facility location problem with penalties
- Approximating \(k\)-hop minimum-spanning trees
- Approximation algorithm for facility location with service installation costs
- On parameterized approximation algorithms for balanced clustering
- Concave connection cost facility location and the star inventory routing problem
- To close is easier than to open: dual parameterization to \(k\)-median
- Polynomial time approximation schemes for clustering in low highway dimension graphs
- Approximation algorithms for stochastic clustering
- Combinatorial approximation algorithms for the robust facility location problem with penalties
- A hybrid multistart heuristic for the uncapacitated facility location problem
- Inventory placement on a network
- A constant-factor approximation algorithm for the k-median problem
- Approximating k-median via pseudo-approximation
- Robust facility leasing problem with penalties
- Clustering with a knapsack constraint: parameterized approximation algorithms for the knapsack median problem
- Approximation algorithm for dynamic facility location problem
- An improved approximation algorithm for uncapacitated facility location problem with penalties
- Efficient black-box reductions for separable cost sharing
- Efficient black-box reductions for separable cost sharing
- Improved approximation algorithms for the robust fault-tolerant facility location problem
- A new approximation algorithm for the multilevel facility location problem
- On Hop-Constrained Steiner Trees in Tree-Like Metrics
- Complexity of single-swap heuristics for metric facility location and related problems
- Approximation algorithms for the robust facility leasing problem
- A PTAS framework for clustering problems in doubling metrics
- k-median/means with outliers revisited: a simple fpt approximation
- A cost-sharing scheme for the k-product facility location game with penalties
- Improved approximation algorithms for constrained fault-tolerant resource allocation
- Approximation algorithms for facility location problems with a special class of subadditive cost functions
- A unified framework of FPT approximation algorithms for clustering problems
- An approximation algorithm for the k-level facility location problem with outliers
- Beyond Moulin mechanisms
- Approximating the \(\tau\)-relaxed soft capacitated facility location problem
- Approximation algorithm for squared metric two-stage stochastic facility location problem
- Local Search Yields Approximation Schemes for k-Means and k-Median in Euclidean and Minor-Free Metrics
- Integrated Supply Chain Management via Randomized Rounding
- Approximation algorithms for soft-capacitated facility location in capacitated network design
- A 6.55 factor primal-dual approximation algorithm for the connected facility location problem
- Complexity and approximability of optimal resource allocation and Nash equilibrium over networks
- Integrality gaps for strengthened linear relaxations of capacitated facility location
- A cross-monotonic cost sharing method for the facility location game with service installation costs
- \(\mathrm{M}^p\)UFLP: universal facility location problem in the \(p\)-th power of metric space
- Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
- Improved lower bound for differentially private facility location
- Fitting distances by tree metrics minimizing the total error within a constant factor
- On the cost of essentially fair clusterings
- Separating \(k\)-\textsc{Median} from the supplier version
- Improved approximation algorithms for multilevel facility location problems
- Approximation algorithm for resource allocation problems with time dependent penalties
- scientific article; zbMATH DE number 1833407 (Why is no real title available?)
- An approximation algorithm for the dynamic facility location problem with outliers
- Incremental facility location problem and its competitive algorithms
- Problem-driven scenario clustering in stochastic optimization
- An LP-rounding based algorithm for soft capacitated facility location problem with submodular penalties
- Inapproximability of the multi-level uncapacitated facility location problem
- Interactive clustering of linear classes and cryptographic lower bounds
- An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties
- Soft-capacitated facility location game
- Data stability in clustering: a closer look
- Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems
- Achieving anonymity via weak lower bound constraints for k-median and k-means
- Individual preference facility location: a dual-fitting framework and its extensions
- Dynamic sum-radii clustering
- A primal-dual 3-approximation algorithm for the stochastic facility location problem with submodular penalties
- An improved approximation algorithm for squared metric \(k\)-facility location
- Improved parameterized approximation for balanced \(k\)-median
- On the budgeted priority p-median problem in high-dimensional Euclidean spaces
- Centrality of trees for capacitated \(k\)-center
- Better guarantees for individual fairness k-median
- FPT Approximation for Constrained Metric k-Median/Means
- An improved competitive algorithm for one-dimensional incremental median problem
- Approximation algorithms for clustering with minimum sum of radii, diameters, and squared radii
- scientific article; zbMATH DE number 7378709 (Why is no real title available?)
This page was built for publication: Greedy Strikes Back: Improved Facility Location Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4240134)
