Dispersing Obnoxious Facilities on Graphs by Rounding Distances.
Tim A. HartmannStefan LendlPublished in: MFCS (2022)
Keyphrases
- facility location problem
- facility location
- approximation algorithms
- demand points
- mixed integer
- undirected graph
- distance function
- graph matching
- graph theoretic
- graph representation
- graph mining
- graph structure
- np hard
- minimum distance
- directed graph
- euclidean distance
- graph theory
- hamming distance
- geodesic distance
- graph partitioning
- graph clustering
- voronoi diagram
- multi criteria
- graph databases
- optimal solution
- bipartite graph
- linear programming
- distance measure
- search algorithm