Improved Combinatorial Algorithms for Facility Location Problems
From MaRDI portal
Publication:5317176
DOI10.1137/S0097539701398594zbMath1075.68100OpenAlexW2033647570MaRDI QIDQ5317176
Publication date: 16 September 2005
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539701398594
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Approximation algorithms (68W25)
Related Items (55)
Combinatorial approximation algorithms for the robust facility location problem with penalties ⋮ A DISTRIBUTED APPROXIMATION ALGORITHM FOR FAULT-TOLERANT METRIC FACILITY LOCATION ⋮ Clustering with or without the approximation ⋮ Analysis of a local search algorithm for the k-facility location problem ⋮ Approximation algorithm for uniform bounded facility location problem ⋮ LP-based approximation for uniform capacitated facility location problem ⋮ Approximation Algorithms for the Robust Facility Location Problem with Penalties ⋮ The distance-constrained matroid median problem ⋮ Min-Max-Min Optimization with Smooth and Strongly Convex Objectives ⋮ An approximation algorithm for the dynamic facility location problem with submodular penalties ⋮ An approximation algorithm for the dynamic facility location problem with outliers ⋮ Centrality of trees for capacitated \(k\)-center ⋮ Approximation algorithm for squared metric two-stage stochastic facility location problem ⋮ Unnamed Item ⋮ A combinatorial approximation algorithm for \(k\)-level facility location problem with submodular penalties ⋮ Approximation algorithms for the fault-tolerant facility placement problem ⋮ Maximum gradient embeddings and monotone clustering ⋮ Approximation algorithms for the priority facility location problem with penalties ⋮ Study and development of the DTD generation system for XML documents ⋮ A local search approximation algorithm for the uniform capacitated \(k\)-facility location problem ⋮ Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms ⋮ Contention-aware data caching in wireless multi-hop ad hoc networks ⋮ Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems ⋮ Approximation algorithm for facility location with service installation costs ⋮ Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach ⋮ Core-Sets: Updated Survey ⋮ Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics ⋮ Approximation Algorithm for the Uniform Bounded Facility Problem ⋮ Local search algorithm for the squared metric \(k\)-facility location problem with linear penalties ⋮ Cache placement in sensor networks under an update cost constraint ⋮ Approximation algorithms for the robust facility leasing problem ⋮ On the Facility Location Problem in Online and Dynamic Models. ⋮ Robust fault tolerant uncapacitated facility location ⋮ Mobile facility location: combinatorial filtering via weighted occupancy ⋮ A distributed O(1)-approximation algorithm for the uniform facility location problem ⋮ Local search algorithms for the red-blue median problem ⋮ Fault-tolerant concave facility location problem with uniform requirements ⋮ Incremental medians via online bidding ⋮ Faster balanced clusterings in high dimension ⋮ Kinetic facility location ⋮ Approximating the two-level facility location problem via a quasi-greedy approach ⋮ Integrating facility location and production planning decisions ⋮ A local search approximation algorithm for a squared metric \(k\)-facility location problem ⋮ An approximation algorithm for \(k\)-facility location problem with linear penalties using local search scheme ⋮ Recent Developments in Approximation Algorithms for Facility Location and Clustering Problems ⋮ Approximating $k$-Median via Pseudo-Approximation ⋮ The Priority k-Median Problem ⋮ An approximation algorithm for the \(k\)-level facility location problem with outliers ⋮ Constant factor approximation algorithm for uniform hard capacitated knapsack median problem ⋮ The ordered \(k\)-median problem: surrogate models and approximation algorithms ⋮ An LP rounding algorithm for approximating uncapacitated facility location problem with penalties ⋮ Facility Location with Matroid or Knapsack Constraints ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Probabilistic \(k\)-median clustering in data streams
This page was built for publication: Improved Combinatorial Algorithms for Facility Location Problems
