Dispersing Obnoxious Facilities on a Graph
Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceeding › Academic › peer-review
We investigate the complexity of this problem in terms of the rational parameter δ. The problem is polynomially solvable, if the numerator of δ is 1 or 2, while all other cases turn out to be NP-hard.
- Algorithms, Complexity, Optimization, Graph theory, Facility location