An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
From MaRDI portal
Publication:5901421
DOI10.1007/978-3-540-74208-1_3zbMath1171.90456OpenAlexW2109549136MaRDI QIDQ5901421
Publication date: 17 February 2009
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/13979
Abstract computational complexity for mathematical programming problems (90C60) Continuous location (90B85) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)
Related Items (27)
Beyond Moulin mechanisms ⋮ New approximation algorithms for the unsplittable capacitated facility location problem ⋮ Approximation algorithm for uniform bounded facility location problem ⋮ LP-based approximation for uniform capacitated facility location problem ⋮ Incremental facility location problem and its competitive algorithms ⋮ Robust network function virtualization ⋮ Centrality of trees for capacitated \(k\)-center ⋮ Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center ⋮ Recovery guarantees for exemplar-based clustering ⋮ On min-max \(r\)-gatherings ⋮ Unnamed Item ⋮ Approximation algorithms for supply chain planning and logistics problems with market choice ⋮ Approximation algorithm for facility location with service installation costs ⋮ Approximation Algorithm for the Uniform Bounded Facility Problem ⋮ Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems ⋮ Approximation Algorithms for Single and Multi-Commodity Connected Facility Location ⋮ A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem ⋮ Robust fault tolerant uncapacitated facility location ⋮ Non-cooperative facility location and covering games ⋮ Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem ⋮ A new approximation algorithm for the multilevel facility location problem ⋮ Soft-capacitated facility location game ⋮ Integrating facility location and production planning decisions ⋮ On Min-Max r-Gatherings ⋮ Recent Developments in Approximation Algorithms for Facility Location and Clustering Problems ⋮ A 6.55 factor primal-dual approximation algorithm for the connected facility location problem ⋮ Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
This page was built for publication: An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
