𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A polynomial-time algorithm for message routing in hierarchical communication networks

✍ Scribed by George G. Polak; Ravindra K. Ahuja

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
456 KB
Volume
80
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A new proximal decomposition algorithm f
A new proximal decomposition algorithm for routing in telecommunication networks
✍ Mahey, P.; Ouorou, A.; LeBlanc, L.; Chifflet, J. πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 125 KB πŸ‘ 2 views

We present a new and much more efficient implementation of the proximal decomposition algorithm for routing in congested telecommunication networks. The routing model that we analyze is a static one intended for use as a subproblem in a network design context. After describing our new implementation

A Hierarchical Architecture for QoS Guar
A Hierarchical Architecture for QoS Guarantees and Routing in Wireless/Mobile Networks
✍ Indu Mahadevan; Krishna M. Sivalingam πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 237 KB

This paper addresses the problem of providing quality of service (QoS) support and routing for wireless networks in the presence of user mobility. The proposed architecture is hierarchical where cells (the basic region of mobile coverage) are organized into QoSΓ‚routing domains. The QoS mechanism is

A Polynomial Time Algorithm for Diophant
A Polynomial Time Algorithm for Diophantine Equations in One Variable
✍ F CUCKER; P KOIRAN; S SMALE πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 195 KB

We exhibit an algorithm computing, for a polynomial f ∈ Z [t], the set of its integer roots. The running time of the algorithm is polynomial in the size of the sparse encoding of f .