Facility Location Problems: A Parameterized View

DOI10.1007/978-3-540-68880-8_19zbMath1143.90354OpenAlexW1933816537WikidataQ57359868 ScholiaQ57359868MaRDI QIDQ3511428

Michael R. Fellows, Henning Fernau

Publication date: 10 July 2008

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68880-8_19

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (1)

Facility location problems: a parameterized view

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity-based induction
• A constant-factor approximation algorithm for the \(k\)-median problem
• The Turing way to parameterized complexity
• Fourier meets M\"{o}bius: fast subset convolution
• Convergence of the Lloyd Algorithm for Computing Centroidal Voronoi Tessellations
• Grammatical Inference: Algorithms and Applications

This page was built for publication: Facility Location Problems: A Parameterized View