The power of priority algorithms for facility location and set cover (Q1884771): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00453-004-1113-2 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2132274124 / rank | |||
Normal rank |
Latest revision as of 02:06, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The power of priority algorithms for facility location and set cover |
scientific article |
Statements
The power of priority algorithms for facility location and set cover (English)
0 references
5 November 2004
0 references
\textit{A. Borodin, M. N. Nielsen} and \textit{C. Rackoff} [Algorithmica 37, 295--326 (2003; Zbl 1082.68521)] introduced the class of so-called priority algorithms as a model for describing natural greedy-like algorithms. In this paper the framework is followed to characterize greedy and greedy-like algorithms for the uncapacitated facility location problem and the set cover problem. The authors give several approximability results. For example, Theorem 1 says that no priority algorithm for the uniform metric facility location problem can achieve an approximation ratio better than 4/3 and by Theorem 8 no priority algorithm for set cover performs better than the greedy algorithm.
0 references
approximation lower bound
0 references
greedy algorithm
0 references
facility location
0 references
set cover
0 references