Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Approximation algorithms for \(k\)-level stochastic facility location problems
- Approximation algorithms for the transportation problem with market choice and related models
- Robust fault tolerant uncapacitated facility location
- Solving facility location problem based on duality approach
- The facility location problem with maximum distance constraint
- Better guarantees for \(k\)-means and Euclidean \(k\)-median by primal-dual algorithms
- An improved branch \& bound method for the uncapacitated competitive location problem
- A distributed O(1)-approximation algorithm for the uniform facility location problem
- Recovery guarantees for exemplar-based clustering
- Local search algorithm for the squared metric \(k\)-facility location problem with linear penalties
- Improved approximation algorithm for fault-tolerant facility placement
- Improved approximation algorithm for k-level uncapacitated facility location problem (with penalties)
- Approximation algorithms for the fault-tolerant facility placement problem
- The facility location problem with general cost functions
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- A General k-Level Uncapacitated Facility Location Problem
- The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem
- An approximation algorithm for k-level squared metric facility location problem with outliers
- A \(k\)-product uncapacitated facility location problem
- Improved approximation algorithms for solving the squared metric k-facility location problem
- 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
- Approximation algorithm for facility location with service installation costs
- Concave connection cost facility location and the star inventory routing problem
- Combinatorial approximation algorithms for the robust facility location problem with penalties
- Inventory placement on a network
- Approximating k-median via pseudo-approximation
- An improved approximation algorithm for uncapacitated facility location problem with penalties
- An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
- A new approximation algorithm for the multilevel facility location problem
- Improved Combinatorial Algorithms for Facility Location Problems
- An approximation algorithm for the \(k\)-median problem with uniform penalties via pseudo-solution
- Approximation algorithms for the robust facility leasing problem
- 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
- scientific article; zbMATH DE number 1187151 (Why is no real title available?)
- An approximation algorithm for the k-level facility location problem with outliers
- A per-scenario bound for the two-stage stochastic facility location problem with linear penalty
- Beyond Moulin mechanisms
- Min Sum Edge Coloring in Multigraphs Via Configuration LP
- An improved per-scenario bound for the two-stage stochastic facility location problem
- Approximating the \(\tau\)-relaxed soft capacitated facility location problem
- Approximation algorithm for squared metric two-stage stochastic facility location problem
- scientific article; zbMATH DE number 5501653 (Why is no real title available?)
- Integrated Supply Chain Management via Randomized Rounding
- 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
- Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
- Improved lower bound for differentially private facility location
- Heuristics for the dynamic facility location problem with modular capacities
- Improved LP-rounding approximation algorithm for k-level uncapacitated facility location
- Improved approximation algorithms for multilevel facility location problems
- Approximation algorithm for resource allocation problems with time dependent penalties
- An approximation algorithm for the dynamic facility location problem with outliers
- On the location and \(p\)-median polytopes
- Inapproximability of the multi-level uncapacitated facility location problem
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
- An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties
- Soft-capacitated facility location game
- On competitive ratio for online uniform facility location problem in random-order model
- An approximation algorithm for the maximization version of the two level uncapacitated facility location problem
- A nearly optimal deterministic online algorithm for non-metric facility location
- Agile optimization for a real‐time facility location problem in Internet of Vehicles networks
- A primal-dual 3-approximation algorithm for the stochastic facility location problem with submodular penalties
- An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem
- Approximation algorithm for the uniform bounded facility problem
- Approximation algorithms for clustering with minimum sum of radii, diameters, and squared radii
- Improved approximation algorithms for capacitated facility location problems
- 2-level station location for bike sharing
- An approximation algorithm for the stochastic fault-tolerant facility location problem
- An efficient heuristic approach for a multi-period logistics network redesign problem
- Recent developments in approximation algorithms for facility location and clustering problems
- Approximation algorithm for k-product uncapacitated facility location problem with submodular penalties
- LP-rounding approximation algorithms for two-stage stochastic fault-tolerant facility location problem
- 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
- An Approximation Algorithm for the k-Median Problem with Uniform Penalties via Pseudo-Solutions
- Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach
- An approximation algorithm for the k-level stochastic facility location problem
- SubModST: a fast generic solver for submodular maximization with size constraints
- Mixed fault tolerance in server assignment: combining reinforcement and backup
- Approximating per-scenario bound for the two-stage stochastic facility location problem
- An approximate cost recovery scheme for the k-product facility location game with penalties
- LP-based approximation for uniform capacitated facility location problem
- Approximation algorithm for uniform bounded facility location problem
- Respecting lower bounds in uniform lower and upper bounded facility location problem
- 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
- LP-rounding algorithms for the fault-tolerant facility placement problem
- On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem
- Graph clustering
- A local search approximation algorithm for a squared metric \(k\)-facility location problem
- A polynomial-time exact algorithm for the connected k-facility location problem on trees
- Approximation Algorithms for the Robust Facility Location Problem with Penalties
- An approximation algorithm for stochastic multi-level facility location problem with soft capacities
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
This page was built for publication: Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4441898)
