Title
Facility location problems: A parameterized view
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.
Year
DOI
Venue
2011
10.1016/j.dam.2011.03.021
Discrete Applied Mathematics
Keywords
Field
DocType
algorithmic perspective,parameterized algorithm,exact algorithms,parameterized algorithms,semistructured documents,linear programming,np -completeness,approximation algorithm,semistructured document,computational biology,operations research literature,facility location problem,facility location problems,parameterized view,np,linear program,operations research
Approximation algorithm,Parameterized complexity,Combinatorics,Algorithmics,Heuristic (computer science),Facility location problem,Heuristics,Linear programming,Mathematics,Computational complexity theory
Journal
Volume
Issue
ISSN
159
11
Discrete Applied Mathematics
Citations 
PageRank 
References 
10
0.64
22
Authors
2
Name
Order
Citations
PageRank
Michael R. Fellows14138319.37
Henning Fernau21646162.68