Many-to-Many Routing on Trees via Matchings (1996)

by Grammati E. Pantziou , Alan Roberts , Antonis Symvonis
Citations:10 - 4 self

Active Bibliography

5 Dynamic Tree Routing under the "Matching with Consumption" Model – Grammati E. Pantziou, Alan Roberts, Antonis Symvonis - 1996
Potential-function-based Analysis of an off-line Heap Construction Algorithm – Alan Roberts, Antonios Symvonis - 2000
2 Efficient Bufferless Packet Switching on Trees and Leveled Networks ∗ – Costas Busch, Malik Magdon-ismail, Marios Mavronicolas
UNIVERSAL BUFFERLESS PACKET SWITCHING ∗ – Costas Busch, Malik Magdon-ismail, Marios Mavronicolas
www.elsevier.com/locate/jpdc Efficient bufferless packet switching on trees and leveled networks � – Costas Busch A, Malik Magdon-ismail A, Marios Mavronicolas B - 2007
30 Potential Function Analysis of Greedy Hot-Potato Routing (Extended Abstract) – Amir Ben-Dor, Shai Halevi, Assaf Schuster - 1994
Lower Bounds for One-to-one Packet Routing on Trees using Hot-Potato Algorithms – Alan Roberts, Antonios Symvonis, David R. Wood - 2000
Simple Algorithms for Hot-Potato Routing – Robert Krauthgamer - 1996
7 A Lower Bound for Nearly Minimal Adaptive and Hot Potato Algorithms – Ishai Ben-Aroya, Donald D. Chinn, Assaf Schuster