Designing Communcation Networks With Hop Restrictions
Designing Communcation Networks With Hop Restrictions
Kemal Atinkemer
The book Designing Communcation Networks With Hop Restrictions was written by author Kemal Atinkemer Here you can read free online of Designing Communcation Networks With Hop Restrictions book, rate and share your impressions in comments. If you don't know what to write, just answer the question: Why is Designing Communcation Networks With Hop Restrictions a good or bad book?
What reading level is Designing Communcation Networks With Hop Restrictions book?
To quickly assess the difficulty of the text, read a short excerpt:
Eval . 1, 139-152. CROWDER, H. , E. L. JOHNSON, and M. W. PADBERG. 1983. Solving Large-scale Zero- one Linear Programming Problems. Oper . Res. 31, 803-834. ESWAREN, K. P. , and R. E. TARJAN. 1976. Augmentation Problems. SIAM J. Comput . 5, 653-665. - 40 - FISHER, M. L. 1981. The Lagrangian Relaxation Method for Solving Integer Programming Problems. Man. Sci. 27, 1-18. FRANK, H. , and W. CHOU. 1971. Routing in Computer Networks. Networks 1, 99-122. FRANK, H. , and W. CHOU. 1972. Topological Opt...imization of Computer Networks. Proc. IEEE 60, 1385-1397. FRATTA, L. , M. GERLA and L. KLEINROCK. 1973. The Flow Deviation Algorithm: An Approach to Store-and-Forward Computer Communication Network Design. Networks 3, 97-133. GALLAGER, R. G. 1977. A Minimum Delay Routing Algorithm Using Distributed Computation. IEEE Trans. Communications COM-25, 73-85. GAVISH, B. 1982. Topological Design of Centralized Computer Networks - Formulations and Algorithms. Networks 12, 355-377. GAVISH, B. , and K. ALTINKEMER.
User Reviews: