Greedy Strikes Back: Improved Facility Location Algorithms
From MaRDI portal
(Redirected from Publication:4240134)
Recommendations
Cited in
(only showing first 100 items - show all)- Approximation algorithms for soft-capacitated facility location in capacitated network design
- An improved approximation algorithm for uncapacitated facility location problem with penalties
- A 6.55 factor primal-dual approximation algorithm for the connected facility location problem
- A cross-monotonic cost sharing method for the facility location game with service installation costs
- An approximation algorithm for a large-scale facility location problem
- Worst-case analysis of the greedy algorithm for a generalization of the maximum \(p\)-facility location problem
- Complexity of single-swap heuristics for metric facility location and related problems
- An improved approximation algorithm for the k-level facility location problem with soft capacities
- A local search approximation algorithm for the uniform capacitated k-facility location problem
- An approximation algorithm for soft capacitated k-facility location problem
- Greedy algorithms for the single-demand facility location problem
- Approximation algorithms for the robust facility leasing problem
- Improved approximation algorithms for capacitated facility location problems
- Approximation algorithms for the transportation problem with market choice and related models
- The General Steiner Tree-Star problem.
- Improved approximation algorithms for multilevel facility location problems
- A constant-factor approximation algorithm for the k-median problem
- Approximation algorithms for the fault-tolerant facility placement problem
- Easy capacitated facility location problems, with connections to lot-sizing
- Approximating the \(\tau\)-relaxed soft capacitated facility location problem
- An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties
- An approximation algorithm for the k-level facility location problem with outliers
- On the power of static assignment policies for robust facility location problems
- The traveling \(k\)-median problem: approximating optimal network coverage
- Bounding quality of pure Nash equilibria in dual-role facility location games
- Improved approximation algorithms for solving the squared metric k-facility location problem
- On parameterized approximation algorithms for balanced clustering
- To close is easier than to open: dual parameterization to \(k\)-median
- Concave connection cost facility location and the star inventory routing problem
- An improved approximation algorithm for squared metric \(k\)-facility location
- Improved parameterized approximation for balanced \(k\)-median
- On stochastic k-facility location
- LP-based approximation for uniform capacitated facility location problem
- \(\mathrm{M}^p\)UFLP: universal facility location problem in the \(p\)-th power of metric space
- Approximation algorithms for the dynamic \(k\)-level facility location problems
- Iterative partial rounding for vertex cover with hard capacities
- Polynomial time approximation schemes for clustering in low highway dimension graphs
- Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem
- Robust fault tolerant uncapacitated facility location
- Soft-capacitated facility location game
- Local search approximation algorithms for the sum of squares facility location problems
- LP-rounding approximation algorithms for two-stage stochastic fault-tolerant facility location problem
- Improved approximation algorithms for constrained fault-tolerant resource allocation
- The minimum k-storage problem on directed graphs
- An approximation algorithm for the \(n\)th power metric facility location problem with linear penalties
- A new approximation algorithm for the k-facility location problem
- On the bounded-hop MST problem on random Euclidean instances
- Approximation algorithms for \(k\)-level stochastic facility location problems
- Perturbation resilience for the facility location problem
- An approximation algorithm for the dynamic facility location problem with outliers
- Approximation algorithms for the fault-tolerant facility location problem with penalties
- Approximation algorithm for squared metric facility location problem with nonuniform capacities
- Approximation algorithm for squared metric two-stage stochastic facility location problem
- A primal-dual approximation algorithm for the facility location problem with submodular penalties
- A \(k\)-product uncapacitated facility location problem
- The approximation gap for the metric facility location problem is not yet closed
- Approximating \(k\)-hop minimum-spanning trees
- Hedging uncertainty: approximation algorithms for stochastic optimization problems
- Approximating the two-level facility location problem via a quasi-greedy approach
- An approximation algorithm for a facility location problem with stochastic demands and inventories
- Incremental algorithms for facility location and \(k\)-median
- Improved approximation algorithm for k-level uncapacitated facility location problem (with penalties)
- Better guarantees for \(k\)-median with service installation costs
- Approximating k-median via pseudo-approximation
- Combinatorial approximation algorithms for the robust facility location problem with penalties
- Interactive clustering of linear classes and cryptographic lower bounds
- Approximation Algorithms for the Robust Facility Location Problem with Penalties
- Solving facility location problem based on duality approach
- LP-based algorithms for capacitated facility location
- Dynamic sum-radii clustering
- An improved competitive algorithm for one-dimensional incremental median problem
- Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
- Integrality gaps for strengthened linear relaxations of capacitated facility location
- Integrating facility location and production planning decisions
- A distributed approximation algorithm for fault-tolerant metric facility location
- An ex-post bound on the greedy heuristic for the uncapacitated facility location problem
- A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
- Improved approximation algorithm for fault-tolerant facility placement
- The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem
- Clustering through continuous facility location problems
- A General k-Level Uncapacitated Facility Location Problem
- 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
- scientific article; zbMATH DE number 1303608 (Why is no real title available?)
- Improved approximation algorithms for the robust fault-tolerant facility location problem
- The facility location problem with general cost functions
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- Approximation algorithms for stochastic and risk-averse optimization
- Local Search Yields Approximation Schemes for k-Means and k-Median in Euclidean and Minor-Free Metrics
- Approximation algorithm for resource allocation problems with time dependent penalties
- Data stability in clustering: a closer look
- Recent developments in approximation algorithms for facility location and clustering problems
- Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach
- scientific article; zbMATH DE number 1833407 (Why is no real title available?)
- A primal-dual 3-approximation algorithm for the stochastic facility location problem with submodular penalties
- Efficient black-box reductions for separable cost sharing
- Privacy preserving clustering with constraints
- Efficient black-box reductions for separable cost sharing
- Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension
- 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)
