network design problems aim to compute low-cost structures such as routes,
trees and subgraphs. Often, it is natural and desirable to require that these
structures have small hop length or hop diameter. Unfortunately, optimization
problems with hop constraints are much harder and less