An 0. 828-approximation algorithm for the uncapacitated facility location problem
From MaRDI portal
Publication:1296569
DOI10.1016/S0166-218X(99)00103-1zbMath0932.90019MaRDI QIDQ1296569
Publication date: 23 November 1999
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
polynomial-time approximation algorithm; satisfiability problem; performance guarantee; uncapacitated facility location
90B80: Discrete location and assignment
Related Items
Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms, Donation center location problem, PASS approximation: a framework for analyzing and designing heuristics, Approximating the two-level facility location problem via a quasi-greedy approach, A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
Cites Work