Greedy Strikes Back: Improved Facility Location Algorithms
From MaRDI portal
Publication:4240134
Recommendations
Cited in
(only showing first 100 items - show all)- Approximation schemes for \(k\)-facility location
- An approximation algorithm for the k-level stochastic facility location problem
- Mixed fault tolerance in server assignment: combining reinforcement and backup
- Efficient approximation schemes for uniform-cost clustering problems in planar graphs
- An approximate cost recovery scheme for the \(k\)-product facility location game with penalties
- LP-based approximation for uniform capacitated facility location problem
- Clustering through continuous facility location problems
- On the power of static assignment policies for robust facility location problems
- A new approximation algorithm for the \(k\)-facility location problem
- The approximation gap for the metric facility location problem is not yet closed
- Approximation algorithms for the fault-tolerant facility location problem with penalties
- A primal-dual approximation algorithm for the facility location problem with submodular penalties
- LP-based algorithms for capacitated facility location
- An improved approximation algorithm for the k-level facility location problem with soft capacities
- A primal-dual approximation algorithm for stochastic facility location problem with service installation costs
- Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem
- Algorithm for \(k\)-product facility location problem with submodular penalties
- A local search approximation algorithm for a squared metric \(k\)-facility location problem
- The minimum \(k\)-storage problem on directed graphs
- Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension
- Hedging uncertainty: approximation algorithms for stochastic optimization problems
- Approximation Algorithms for the Robust Facility Location Problem with Penalties
- Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
- Integrating facility location and production planning decisions
- A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
- Approximation algorithms for stochastic and risk-averse optimization
- Local search algorithm for universal facility location problem with linear penalties
- On the bounded-hop MST problem on random Euclidean instances
- Approximation algorithms for the dynamic \(k\)-level facility location problems
- A local search approximation algorithm for the uniform capacitated k-facility location problem
- An approximation algorithm for soft capacitated k-facility location problem
- Improved approximation algorithms for the facility location problems with linear/submodular penalties
- The traveling \(k\)-median problem: approximating optimal network coverage
- Approximation algorithms for \(k\)-level stochastic facility location problems
- Privacy preserving clustering with constraints
- Approximation algorithms for the transportation problem with market choice and related models
- Robust fault tolerant uncapacitated facility location
- An ex-post bound on the greedy heuristic for the uncapacitated facility location problem
- An approximation algorithm for the risk-adjusted two-stage stochastic facility location problem with penalties
- Solving facility location problem based on duality approach
- The facility location problem with maximum distance constraint
- Randomized priority algorithms
- Bounding quality of pure Nash equilibria in dual-role facility location games
- A distributed approximation algorithm for fault-tolerant metric facility location
- On stochastic k-facility location
- Better guarantees for \(k\)-median with service installation costs
- A distributed O(1)-approximation algorithm for the uniform facility location problem
- 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
- A \(k\)-product uncapacitated facility location problem
- 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
- 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
- A constant-factor approximation algorithm for the k-median problem
- Approximating \(k\)-median via pseudo-approximation
- 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
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)
