On $G^p$-unimodality of radius functions in graphs: structure and algorithms
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866913745539694592 |
|---|---|
| author | Chalopin, Jérémie Chepoi, Victor Dragan, Feodor Ducoffe, Guillaume Vaxès, Yann |
| author_facet | Chalopin, Jérémie Chepoi, Victor Dragan, Feodor Ducoffe, Guillaume Vaxès, Yann |
| contents | For every weight assignment $π$ to the vertices in a graph $G$, the radius function $r_π$ maps every vertex of $G$ to its largest weighted distance to the other vertices. The center problem asks to find a center, i.e., a vertex of $G$ that minimizes $r_π$. We here study some local properties of radius functions in graphs, and their algorithmic implications; our work is inspired by the nice property that in Euclidean spaces every local minimum of every radius function $r_π$ is a center. We study a discrete analogue of this property for graphs, which we name $G^p$-unimodality: specifically, every vertex that minimizes the radius function in its ball of radius $p$ must be a central vertex. While it has long been known since Dragan (1989) that graphs with $G$-unimodal radius functions $r_π$ are exactly the Helly graphs, the class of graphs with $G^2$-unimodal radius functions has not been studied insofar. We prove the latter class to be much larger than the Helly graphs, since it also comprises (weakly) bridged graphs, graphs with convex balls, and bipartite Helly graphs.
Recently, using the $G$-unimodality of radius functions $r_π$, a randomized $\widetilde{\mathcal{O}}(\sqrt{n}m)$-time local search algorithm for the center problem on Helly graphs was proposed by Ducoffe (2023). Assuming the Hitting Set Conjecture (Abboud et al., 2016), we prove that a similar result for the class of graphs with $G^2$-unimodal radius functions is unlikely. However, we design local search algorithms (randomized or deterministic) for the center problem on many of its important subclasses. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_15011 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On $G^p$-unimodality of radius functions in graphs: structure and algorithms Chalopin, Jérémie Chepoi, Victor Dragan, Feodor Ducoffe, Guillaume Vaxès, Yann Data Structures and Algorithms Combinatorics For every weight assignment $π$ to the vertices in a graph $G$, the radius function $r_π$ maps every vertex of $G$ to its largest weighted distance to the other vertices. The center problem asks to find a center, i.e., a vertex of $G$ that minimizes $r_π$. We here study some local properties of radius functions in graphs, and their algorithmic implications; our work is inspired by the nice property that in Euclidean spaces every local minimum of every radius function $r_π$ is a center. We study a discrete analogue of this property for graphs, which we name $G^p$-unimodality: specifically, every vertex that minimizes the radius function in its ball of radius $p$ must be a central vertex. While it has long been known since Dragan (1989) that graphs with $G$-unimodal radius functions $r_π$ are exactly the Helly graphs, the class of graphs with $G^2$-unimodal radius functions has not been studied insofar. We prove the latter class to be much larger than the Helly graphs, since it also comprises (weakly) bridged graphs, graphs with convex balls, and bipartite Helly graphs. Recently, using the $G$-unimodality of radius functions $r_π$, a randomized $\widetilde{\mathcal{O}}(\sqrt{n}m)$-time local search algorithm for the center problem on Helly graphs was proposed by Ducoffe (2023). Assuming the Hitting Set Conjecture (Abboud et al., 2016), we prove that a similar result for the class of graphs with $G^2$-unimodal radius functions is unlikely. However, we design local search algorithms (randomized or deterministic) for the center problem on many of its important subclasses. |
| title | On $G^p$-unimodality of radius functions in graphs: structure and algorithms |
| topic | Data Structures and Algorithms Combinatorics |
| url | https://arxiv.org/abs/2503.15011 |