between a source $s$ and a target $t$ is independent from the current traffic

in the network. Hence, such a scheme consists of probability distributions

over $s-t$ paths for every source-target pair $s,t$ in the network.

In a recent result citeR02 it was shown that for any undirected network

there is an oblivious routing scheme that achieves a polylogarithmic

competitive ratio with respect to congestion. Subsequently, Azar et

al. citeACF+03 gave a polynomial time algorithm that for a given network

constructs the best oblivious routing scheme, i.e. the scheme that guarantees

the best possible competitive ratio.

Unfortunately, the latter result is based on the Ellipsoid algorithm; hence

it is unpractical for large networks.

In this paper we present a combinatorial algorithm for constructing an

oblivious routing scheme that guarantees a competitive ratio of $O(log^4n)$

for undirected networks. Furthermore, our approach yields a proof

for the existence of an oblivious routing scheme with competitive ratio

$O(log^3n)$, which is much simpler than the original proof from citeR02.}, author = {Bienkowski, Marcin and Korzeniowski, Miroslaw and Räcke, Harald}, booktitle = {Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '03}, isbn = {1581136617}, title = {{A practical algorithm for constructing oblivious routing schemes}}, doi = {10.1145/777412.777418}, year = {2003}, } @inbook{19354, author = {Eke, Norbert Otto}, booktitle = {Romantik und Vormärz. Zur Archäologie literarischer Kommunikation in der ersten Hälfte des 19. Jahrhunderts}, editor = {Bunzel, Wolfgang and Stein, Peter and Vaßen, Florian}, pages = {163--183}, publisher = {Aisthesis}, title = {{Moderne Zeit(en). Der Kampf um die Zeit in Romantik und Vormärz}}, year = {2003}, } @misc{19828, author = {Mahlmann, Peter}, title = {{Implementierung und Vergleich von Verfahren zum Information Retrieval im World Wide Web}}, year = {2003}, } @inproceedings{19900, author = {Klein, Jan and Zachmann, Gabriel}, booktitle = { Proc. ACM Symposium on Virtual Reality Software and Technology (VRST 2003)}, pages = {22--31}, title = {{Time-Critical Collision Detection Using an Average-Case Approach}}, doi = {10.1145/1008653.1008660}, year = {2003}, } @inproceedings{2128, author = {Damerow, Valentina and Meyer auf der Heide, Friedhelm and Räcke, Harald and Scheideler, Christian and Sohler, Christian}, booktitle = {ESA}, pages = {161----171}, publisher = {Springer}, title = {{Smoothed Motion Complexity}}, doi = {10.1007/978-3-540-39658-1_17}, volume = {2832}, year = {2003}, } @inproceedings{21056, author = {Meschut, Gerson}, location = {Stuttgart}, title = {{Kleben und Mechanisches Fügen – Verbindungstechniken im Produktlebenszyklus von Leichtbaustrukturen}}, year = {2003}, } @inproceedings{21157, author = {Meschut, Gerson}, location = {Berlin}, title = {{Kleben – Schlüsseltechnologie für die Fahrzeugmischbauweise}}, year = {2003}, } @inproceedings{16805, author = {Schroeder, Monika and Domik, Gitta}, booktitle = {DeLFI 2003, Tagungsband der 1. e-Learning Fachtagung Informatik, 16.-18. September 2003 in Garching bei München}, editor = {Bode, Arndt and Desel, Jörg and Rathmayer, Sabine and Wessner, Martin}, pages = {402--411}, publisher = {{GI}}, title = {{Veränderungen von Lehreinheiten durch veränderte Ansprüche am Beispiel Computerbilder}}, volume = {(P-37)}, year = {2003}, } @article{22617, author = {de los Arcos, T. and Wu, Z.M. and Oelhafen, P.}, issn = {0009-2614}, journal = {Chemical Physics Letters}, pages = {419--423}, title = {{Is aluminum a suitable buffer layer for carbon nanotube growth?}}, doi = {10.1016/j.cplett.2003.09.057}, year = {2003}, } @article{16482, author = {Juurlink, Bernhardus and Kolman, Petr and Meyer auf der Heide, Friedhelm and Rieping, Ingo}, issn = {1570-8667}, journal = {Journal of Discrete Algorithms}, pages = {151--166}, title = {{Optimal broadcast on parallel locality models}}, doi = {10.1016/s1570-8667(03)00023-6}, year = {2003}, } @phdthesis{24613, author = {Bobda, Christophe}, publisher = {Universität Paderborn, Heinz Nixdorf Institut, Entwurf Paralleler Systeme}, title = {{Synthesis of Dataflow Graphs for Reconfigurable Systems using Temporal Partitioning and Temporal Placement}}, volume = {128}, year = {2003}, } @phdthesis{24620, author = {Keil-Slawik, Reinhard and Brennecke, Andreas}, publisher = {Heinz Nixdorf Institut, Universität Paderborn}, title = {{ISIS: Installationshandbuch für lernförderliche Infrastrukturen}}, volume = {131}, year = {2003}, } @phdthesis{24606, author = {Molt, Thorsten}, publisher = {Heinz Nixdorf Institut, Universität Paderborn}, title = {{Eine domänenübergreifende Softwarespezifikationstechnik für automatisierte Fertigungsanlagen}}, volume = {121}, year = {2003}, } @inproceedings{13376, abstract = {In knowledge intense business processes, a complex and dynamic body of knowledge is being built bottom-up by experience learning during exception handling and problem solving. Traditional qualification programs do not very effectively provide the special skills required. Communities of Practice are better supporting this dynamic on-the-job learning across hierarchies. Still, CoP approaches and platforms in many organisations can be improved by enriching them with e-learning components to create a connection between the unstructured personalisation strategy of CoPs and the structured training materials. Similarly, e-learning benefits from being linked to communities. In the article, the connections of both areas are analysed to derive a framework for integration. It proposes an agenda of activities for the two domains people-oriented and content-oriented integration of community management and e- learning. These two aspects affect the handling, configuration and design of software features. In a first stage, the challenge is mainly a management and organisational task. Consecutively, the integration processes can be further assessed in order to identify potentials for IT-automatisation.}, author = {Trier, Matthias}, booktitle = {Proceedings of Organizational Knowledge, Learning and Capabilities Conference OKLC 2003, Barcelona, 13. April 2003.}, title = {{Integrating Communities of Practice with e-learning platforms to improve on-the-job-learning}}, year = {2003}, }