Wall of Fame | Most Viewed NETWORKS-2002 Paper
11 years 1 months ago
Approximation algorithms for constructing wavelength routing networks
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
Refael Hassin, Asaf Levin
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source186
2Download preprint from source134
3Download preprint from source119
4Download preprint from source96
5Download preprint from source80
6Download preprint from source73
7Download preprint from source71
8Download preprint from source66
9Download preprint from source63
10Download preprint from source63