Facility Location Problems: A Parameterized View

Authors:
Michael Fellows;Henning Fernau
Affiliations:
The University of Newcastle, Callaghan, Australia NSW 2308;The University of Newcastle, Callaghan, Australia NSW 2308 and Universität Trier, FB IV--Abteilung Informatik, Trier, Germany 54286
Venue:
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Year:
2008

Citing 10
Cited 1

Complexity–Based Induction

Machine Learning
Approximation algorithms for facility location problems (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
K-medians, facility location, and the Chernoff-Wald bound

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Algorithms for facility location problems with outliers

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
XTRACT: Learning Document Type Descriptors from XML Document Collections

Data Mining and Knowledge Discovery
A constant-factor approximation algorithm for the k-median problem

Journal of Computer and System Sciences - STOC 1999
The turing way to parameterized complexity

Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Convergence of the Lloyd Algorithm for Computing Centroidal Voronoi Tessellations

SIAM Journal on Numerical Analysis
Fourier meets möbius: fast subset convolution

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Parameterized Complexity

Parameterized Complexity

Facility location problems: A parameterized view

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Facility Location can be seen as a whole family of problems which have many obvious applications in economics. They have been widely explored in the Operations Research community, from the viewpoints of approximation, heuristics, linear programming, etc. We add a new facet by initiating the study of some of these problems from a parametric point of view. Moreover, we exhibit some less obvious applications of these algorithms in the processing of semistructured documents and in computational biology.