Optimizing Administrative Divisions: A Vertex $k$-Center Approach for Edge-Weighted Road Graphs
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918158210695168 |
|---|---|
| author | Daugulis, Peteris |
| author_facet | Daugulis, Peteris |
| contents | Efficient and equitable access to municipal services hinges on well-designed administrative divisions. It requires ongoing adaptation to changing demographics, infrastructure, and economic factors. This article proposes a novel transparent data-driven method for territorial division based on the Voronoi partition of edge-weighted road graphs and the vertex $k$-center problem as a special case of the minimax facility location problem. By considering road network structure and strategic placement of administrative centers, this method seeks to minimize travel time disparities and ensure a more balanced distribution of administrative time burden for the population. We show implementations of this approach in the context of Latvia, a country with complex geographical features and diverse population distribution. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_09334 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Optimizing Administrative Divisions: A Vertex $k$-Center Approach for Edge-Weighted Road Graphs Daugulis, Peteris Data Structures and Algorithms Efficient and equitable access to municipal services hinges on well-designed administrative divisions. It requires ongoing adaptation to changing demographics, infrastructure, and economic factors. This article proposes a novel transparent data-driven method for territorial division based on the Voronoi partition of edge-weighted road graphs and the vertex $k$-center problem as a special case of the minimax facility location problem. By considering road network structure and strategic placement of administrative centers, this method seeks to minimize travel time disparities and ensure a more balanced distribution of administrative time burden for the population. We show implementations of this approach in the context of Latvia, a country with complex geographical features and diverse population distribution. |
| title | Optimizing Administrative Divisions: A Vertex $k$-Center Approach for Edge-Weighted Road Graphs |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2510.09334 |