Hop-Constrained Tree-Shaped Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Book Sections Year : 2014

Hop-Constrained Tree-Shaped Networks


Hop constraints are used to limit the number of links between two given points in a network, this way improving the quality of service by increasing the availability and reliability of the network. They have been applied to a limited number of problems, although their application can be of the greatest importance both from the academical and practical points-of-view. In this work, we survey relevant and recent works on hop-constrained problems focusing on problems with tree shaped solutions.
No file

Dates and versions

hal-01122335 , version 1 (03-03-2015)



Marta S. R. Monteiro, Dalila B. M. M. Fontes, Fernando A. C. C. Fontes. Hop-Constrained Tree-Shaped Networks. Sergiy Butenko; Eduardo L. Pasiliao; Volodymyr Shylo. Examining Robustness and Vulnerability of Networked Systems, 37, IOS, pp.192 - 208, 2014, NATO Science for Peace and Security Series - D: Information and Communication Security, 978-1-61499-390-2. ⟨10.3233/978-1-61499-391-9-192⟩. ⟨hal-01122335⟩
47 View
0 Download



Gmail Facebook X LinkedIn More