Cargando…
The Connected P-Median Problem on Cactus Graphs
This study deals with the facility location problem of locating a set V(p) of p facilities on a graph such that the subgraph induced by V(p) is connected. We consider the connected p-median problem on a cactus graph G whose vertices and edges have nonnegative weights. The aim of a connected p-median...
Autores principales: | Bai, Chunsong, Zhou, Jianjie, Liang, Zuosong |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Hindawi
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8727095/ https://www.ncbi.nlm.nih.gov/pubmed/34992643 http://dx.doi.org/10.1155/2021/3533623 |
Ejemplares similares
-
On Hamiltonian Decomposition Problem of 3-Arc Graphs
por: Xu, Guangjun, et al.
Publicado: (2022) -
A Linear-Time Algorithm for 4-Coloring Some Classes of Planar Graphs
por: Liang, Zuosong, et al.
Publicado: (2021) -
Connectivity problems on heterogeneous graphs
por: Wu, Jimmy, et al.
Publicado: (2019) -
Cactus = cacti.
Publicado: (1989) -
Cactus Grandiflora
Publicado: (1891)