Cargando…
Continuous facility location on graphs
We study a continuous facility location problem on undirected graphs where all edges have unit length and where the facilities may be positioned on the vertices as well as on interior points of the edges. The goal is to cover the entire graph with a minimum number of facilities with covering range [...
Autores principales: | Hartmann, Tim A., Lendl, Stefan, Woeginger, Gerhard J. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer Berlin Heidelberg
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8907126/ https://www.ncbi.nlm.nih.gov/pubmed/35300152 http://dx.doi.org/10.1007/s10107-021-01646-x |
Ejemplares similares
-
Matroid bases with cardinality constraints on the intersection
por: Lendl, Stefan, et al.
Publicado: (2021) -
Non-Preemptive Tree Packing
por: Lendl, Stefan, et al.
Publicado: (2022) -
Graph identification of proteins in tomograms (GRIP‐Tomo)
por: George, August, et al.
Publicado: (2023) -
Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
por: Gribling, Sander, et al.
Publicado: (2018) -
NKp46‐specific single domain antibodies enable facile engineering of various potent NK cell engager formats
por: Lipinski, Britta, et al.
Publicado: (2023)