Abstract
A practical algorithm for constructing Oblivious routing schemes was studied. Algorithms for specific networks and nonpolynomial algorithm for general networks were also discussed. An optimal algorithm that deals with optimal competitive ratio for oblivious algorithm and which is based on linear programming and the Ellipsoid algorithm with a separation oracle was studied. Hierarchical decomposition and hierarchical routing scheme were studied.
Original language | English |
---|---|
Pages | 1-13 |
Number of pages | 13 |
State | Published - 2003 |
Event | 4th ACM Federated Computing Research Conference, FCRC 2003 - San Diego, CA, United States Duration: 7 Jun 2003 → 9 Jun 2003 |
Conference
Conference | 4th ACM Federated Computing Research Conference, FCRC 2003 |
---|---|
Country/Territory | United States |
City | San Diego, CA |
Period | 7/06/03 → 9/06/03 |