Facility location on planar graphs with unreliable links
From MaRDI portal
Publication:1625178
DOI10.1007/978-3-319-90530-3_23zbMath1485.68194OpenAlexW2802342610MaRDI QIDQ1625178
R. Vijayaragunathan, Meghana Nasre, N. S. Narayanaswamy
Publication date: 28 November 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-90530-3_23
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) 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: Facility location on planar graphs with unreliable links
