Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links

DOI10.1007/978-3-642-04128-0_24zbMath1486.68133OpenAlexW1508387489MaRDI QIDQ3639252

R. Ravi, F. Sibel Salman, Refael Hassin

Publication date: 29 October 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04128-0_24

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Discrete location and assignment (90B80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (2)

On the Parameterized Complexity of the Expected Coverage Problem ⋮ On the parameterized complexity of the expected coverage problem

This page was built for publication: Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links