| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 420256 | Discrete Applied Mathematics | 2011 | 13 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Michael R. Fellows, Henning Fernau,