Facility dispersion and remote subgraphs

DOI10.1007/3-540-61422-2_120zbMath1502.68216OpenAlexW2068073180MaRDI QIDQ5054806

Barun Chandra, Magnús M. Halldórsson

Publication date: 9 December 2022

Published in: Algorithm Theory — SWAT'96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61422-2_120

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Discrete location and assignment (90B80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Approximation algorithms for maximum dispersion ⋮ Approximation algorithms for minimum tree partition

Cites Work

• Unnamed Item
• The discrete p-dispersion problem
• Analytical models for locating undesirable facilities
• The maximal dispersion problem and the ``first point outside the neighbourhood heuristic
• Improved non-approximability results
• An Analysis of Network Location Problems with Distance Constraints
• Comparison Of Four Models For dispersing Facilities
• Obnoxious Facility Location on Graphs
• Heuristic and Special Case Algorithms for Dispersion Problems

This page was built for publication: Facility dispersion and remote subgraphs