A practical algorithm for constructing oblivious routing schemes

Marcin Bieńkowski, Mirosław Korzeniowski, Harald Räcke

Research output: Contribution to conferencePaperpeer-review

28 Scopus citations

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 languageEnglish
Pages1-13
Number of pages13
StatePublished - 2003
Event4th ACM Federated Computing Research Conference, FCRC 2003 - San Diego, CA, United States
Duration: 7 Jun 20039 Jun 2003

Conference

Conference4th ACM Federated Computing Research Conference, FCRC 2003
Country/TerritoryUnited States
CitySan Diego, CA
Period7/06/039/06/03

Fingerprint

Dive into the research topics of 'A practical algorithm for constructing oblivious routing schemes'. Together they form a unique fingerprint.

Cite this