Facility location problems: A parameterized view

Authors:
Michael R. Fellows;Henning Fernau
Affiliations:
Charles Darwin University, Darwin, Northern Territory 0909, Australia;Universität Trier, FB IV-Abteilung Informatik, 54286 Trier, Germany
Venue:
Discrete Applied Mathematics
Year:
2011

Citing 18
Cited 3

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
XTRACT: a system for extracting document type descriptors from XML documents

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
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
Capacitated vertex covering

Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
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
Infeasibility of instance compression and succinct PCPs for NP

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Facility Location Problems: A Parameterized View

AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Incompressibility through Colors and IDs

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
On problems without polynomial kernels

Journal of Computer and System Sciences
Capacitated domination and covering: a parameterized perspective

IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem

SIAM Journal on Computing
Parameterized Complexity

Parameterized Complexity

Determination of the locations and capacities of sugar cane loading stations in Thailand

Computers and Industrial Engineering
On the computation of fully proportional representation

Journal of Artificial Intelligence Research
Position Unmanned Aerial Vehicles in the Mobile Ad Hoc Network

Journal of Intelligent and Robotic Systems

Quantified Score

Hi-index	0.04

Visualization

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.