Balancing graph Voronoi diagrams with one more vertex - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Networks Année : 2024

Balancing graph Voronoi diagrams with one more vertex

Résumé

Abstract Let be a graph with unit‐length edges and nonnegative costs assigned to its vertices. Given a list of pairwise different vertices , the prioritized Voronoi diagram of with respect to is the partition of in subsets so that, for every with , a vertex is in if and only if is a closest vertex to in and there is no closest vertex to in within the subset . For every with , the load of vertex equals the sum of the costs of all vertices in . The load of equals the maximum load of a vertex in . We study the problem of adding one more vertex at the end of in order to minimize the load. This problem occurs in the context of optimally locating a new service facility (e.g., a school or a hospital) while taking into account already existing facilities, and with the goal of minimizing the maximum congestion at a site. There is a brute‐force algorithm for solving this problem in time on ‐vertex ‐edge graphs. We prove a matching time lower bound–up to sub‐polynomial factors–for the special case where and , assuming the so called Hitting Set Conjecture of Abboud et al. On the positive side, we present simple linear‐time algorithms for this problem on cliques, paths and cycles, and almost linear‐time algorithms for trees, proper interval graphs and (assuming to be a constant) bounded‐treewidth graphs.
Fichier principal
Vignette du fichier
Load_final.pdf (499.25 Ko) Télécharger le fichier
Licence : CC BY - Paternité

Dates et versions

hal-04445634 , version 1 (08-02-2024)

Identifiants

Citer

Guillaume Ducoffe. Balancing graph Voronoi diagrams with one more vertex. Networks, 2024, 83 (2), pp.368-389. ⟨10.1002/net.22198⟩. ⟨hal-04445634⟩
5 Consultations
22 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More