TY - JOUR
T1 - Facility location problems
T2 - a parameterized view
AU - Fellows, Michael
AU - Fernau, Henning
PY - 2011
Y1 - 2011
N2 - Facility location problems have been investigated in the Operations Research literature from a variety of algorithmic perspectives, including those of approximation algorithms, heuristics, and linear programming. We introduce the study of these problems from the point of view of parameterized algorithms and complexity. Some applications of algorithms for these problems in the processing of semistructured documents and in computational biology are also described.
AB - Facility location problems have been investigated in the Operations Research literature from a variety of algorithmic perspectives, including those of approximation algorithms, heuristics, and linear programming. We introduce the study of these problems from the point of view of parameterized algorithms and complexity. Some applications of algorithms for these problems in the processing of semistructured documents and in computational biology are also described.
KW - Exact algorithms
KW - Facility location problems
KW - NP-completeness
KW - Parameterized algorithms
KW - Semi-structured documents
KW - Bioinformatics
KW - Computational complexity
KW - Linear programming
KW - Parameterization
KW - Approximation algorithms
U2 - 10.1016/j.dam.2011.03.021
DO - 10.1016/j.dam.2011.03.021
M3 - Article
VL - 159
SP - 1118
EP - 1130
JO - Discrete Applied Mathematics
JF - Discrete Applied Mathematics
SN - 0166-218X
IS - 11
ER -