Routing algorithms in VLSI design form the backbone of interconnect synthesis, ensuring that circuit elements are connected efficiently while conforming to strict physical and timing constraints.

This paper applies spectral efficiency as a performance measure for routing schemes and considers how to obtain a good route in a wireless network as the network signal-to-noise ratio (SNR) varies.

Mathematicians from RUDN University have created a new routing algorithm in the Internet of Things network. It optimally splits traffic, which improves network speed and reliability.

This work focuses on using self-organizing algorithms employed in the field of wireless sensor networks to networks-on-chip (NoCs) and presents a method for choosing hierarchical coordinates and a ...

Vehicle routing problems (VRPs) are among the most studied problems in operations research. Nowadays, the leading exact algorithms for solving many classes of VRPs are branch-price-and-cut algorithms.