Improved Combinatorial Algorithms for Facility Location Problems
From MaRDI portal
Recommendations
Cited in
(71)- An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
- A local search approximation algorithm for the uniform capacitated k-facility location problem
- Approximation algorithms for the robust facility leasing problem
- Improved approximation algorithms for capacitated facility location problems
- Approximation algorithms for the fault-tolerant facility placement problem
- Maximum gradient embeddings and monotone clustering
- Local search algorithm for the squared metric \(k\)-facility location problem with linear penalties
- Faster balanced clusterings in high dimension
- An approximation algorithm for the k-level facility location problem with outliers
- LP-based approximation for uniform capacitated facility location problem
- The distance-constrained matroid median problem
- Robust fault tolerant uncapacitated facility location
- Mobile facility location: combinatorial filtering via weighted occupancy
- The ordered \(k\)-median problem: surrogate models and approximation algorithms
- Probabilistic k-median clustering in data streams
- Clustering with or without the approximation
- Approximation algorithm for uniform bounded facility location problem
- An approximation algorithm for the dynamic facility location problem with outliers
- Approximation algorithm for squared metric two-stage stochastic facility location problem
- Study and development of the DTD generation system for XML documents
- From stars to comets: improved local search for universal facility location
- Cache placement in sensor networks under an update cost constraint
- Incremental medians via online bidding
- Approximating the two-level facility location problem via a quasi-greedy approach
- Approximating k-median via pseudo-approximation
- Combinatorial approximation algorithms for the robust facility location problem with penalties
- Approximation Algorithms for the Robust Facility Location Problem with Penalties
- Local search based approximation algorithms for two-stage stochastic location problems
- Approximation algorithm for the uniform bounded facility problem
- Integrating facility location and production planning decisions
- A distributed approximation algorithm for fault-tolerant metric facility location
- Analysis of a local search algorithm for the k-facility location problem
- Core-sets: updated survey
- scientific article; zbMATH DE number 3848936 (Why is no real title available?)
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- An approximation algorithm for the dynamic facility location problem with submodular penalties
- Local Search Yields Approximation Schemes for k-Means and k-Median in Euclidean and Minor-Free Metrics
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
- 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
- Constant factor approximation algorithm for uniform hard capacitated knapsack median problem
- Better guarantees for \(k\)-means and Euclidean \(k\)-median by primal-dual algorithms
- Facility Location with Matroid or Knapsack Constraints
- A distributed O(1)-approximation algorithm for the uniform facility location problem
- The Priority k-Median Problem
- Approximating the two-level facility location problem via a quasi-greedy approach
- Inapproximability of the multi-level uncapacitated facility location problem
- Constant factor approximation algorithm for the knapsack median problem
- scientific article; zbMATH DE number 7651196 (Why is no real title available?)
- A local search approximation algorithm for a squared metric \(k\)-facility location problem
- Min-Max-Min Optimization with Smooth and Strongly Convex Objectives
- On the Facility Location Problem in Online and Dynamic Models.
- A combinatorial approximation algorithm for \(k\)-level facility location problem with submodular penalties
- Contention-aware data caching in wireless multi-hop ad hoc networks
- Respecting lower bounds in uniform lower and upper bounded facility location problem
- An o( n)-approximation for submodular facility location
- A polynomial-time exact algorithm for the connected k-facility location problem on trees
- Local search algorithms for the red-blue median problem
- Fault-tolerant concave facility location problem with uniform requirements
- Clustering under a knapsack constraint: parameterized approximation for the knapsack median problem
- Robust facility leasing problem with penalties
- Clustering with a knapsack constraint: parameterized approximation algorithms for the knapsack median problem
- Capacitated facility location with outliers and uniform facility costs
- A nearly optimal deterministic online algorithm for non-metric facility location
- An LP-rounding based algorithm for soft capacitated facility location problem with submodular penalties
- Capacitated facility location with outliers and uniform facility costs
- An approximation algorithm for \(k\)-facility location problem with linear penalties using local search scheme
- Centrality of trees for capacitated \(k\)-center
- Approximation algorithms for the priority facility location problem with penalties
- Approximation algorithm for facility location with service installation costs
- Kinetic facility location
This page was built for publication: Improved Combinatorial Algorithms for Facility Location Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317176)
