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.90456MaRDI QIDQ5901421

Jaroslaw Byrka

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


90C60: Abstract computational complexity for mathematical programming problems

90B85: Continuous location

90C05: Linear programming

90C59: Approximation methods and heuristics in mathematical programming

68W25: Approximation algorithms


Related Items

Recent Developments in Approximation Algorithms for Facility Location and Clustering Problems, Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem, On Min-Max r-Gatherings, Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem, Unnamed Item, Robust network function virtualization, Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center, New approximation algorithms for the unsplittable capacitated facility location problem, Incremental facility location problem and its competitive algorithms, On min-max \(r\)-gatherings, Approximation algorithms for supply chain planning and logistics problems with market choice, Beyond Moulin mechanisms, Centrality of trees for capacitated \(k\)-center, Recovery guarantees for exemplar-based clustering, Approximation algorithm for facility location with service installation costs, Non-cooperative facility location and covering games, A new approximation algorithm for the multilevel facility location problem, A 6.55 factor primal-dual approximation algorithm for the connected facility location problem, LP-based approximation for uniform capacitated facility location problem, Robust fault tolerant uncapacitated facility location, Soft-capacitated facility location game, Approximation algorithm for uniform bounded facility location problem, 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, Integrating facility location and production planning decisions