Approximation Algorithms for Directed Buy-at-Bulk Spanners with Distance Constraints

The authors present the first sublinear factor approximation algorithms for the directed buy-at-bulk spanner problem, which unifies the buy-at-bulk network design and directed spanner problems. The algorithms handle distance constraints and allow for negative edge lengths.