MOR   2000
Wall of Fame | Most Viewed MOR-2000 Paper
162views more  MOR 2000»
12 years 11 months ago
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
Alok Baveja, Aravind Srinivasan
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 source162
2Download preprint from source90
3Download preprint from source74
4Download preprint from source74
5Download preprint from source67
6Download preprint from source67
7Download preprint from source66
8Download preprint from source58