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.
| Originalsprache | Englisch |
|---|---|
| Seiten | 1-13 |
| Seitenumfang | 13 |
| Publikationsstatus | Veröffentlicht - 2003 |
| Veranstaltung | 4th ACM Federated Computing Research Conference, FCRC 2003 - San Diego, CA, USA/Vereinigte Staaten Dauer: 7 Juni 2003 → 9 Juni 2003 |
Konferenz
| Konferenz | 4th ACM Federated Computing Research Conference, FCRC 2003 |
|---|---|
| Land/Gebiet | USA/Vereinigte Staaten |
| Ort | San Diego, CA |
| Zeitraum | 7/06/03 → 9/06/03 |