Titlebook: Data Structures and Efficient Algorithms; Final Report on the B. Monien,Th. Ottmann Book 1992 Springer-Verlag Berlin Heidelberg 1992 algor

MAUVE

https://doi.org/10.1007/978-1-4471-4594-3et of solutions. Both algorithms were implemented on a local memory multiprocessor system of 32 transputers. Empirical results indicate that — due to the problem‘s complexity — sophisticated heuristics are the only mean to get reasonable solutions for larger problem sizes.

KIN

Computer and Information Sciences IIIs its slowness in the worst case. Finally, in the third strategy class presented the packets are split up into subpackets which are routed along the network in a pipelined fashion. Here the balancing is achieved by local reservation of communication channels. For several variants of this method worst-case configurations are discussed.