Optimization problems in correlated networks

BACKGROUND: Solving the shortest path and min-cut problems are key in achieving high-performance and robust communication networks. Those problems have often been studied in deterministic and uncorrelated networks both in their original formulations as well as in several constrained variants. Howeve...

Descripción completa

Detalles Bibliográficos
Autores principales: Yang, Song, Trajanovski, Stojan, Kuipers, Fernando A.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer International Publishing 2016
Materias:
Research
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5749611/
https://www.ncbi.nlm.nih.gov/pubmed/29355235
http://dx.doi.org/10.1186/s40649-016-0026-y

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5749611/
https://www.ncbi.nlm.nih.gov/pubmed/29355235
http://dx.doi.org/10.1186/s40649-016-0026-y

Ejemplares similares