Dynamic tree routing under the “matching with consumption” model

DOI10.1007/BFB0009504MaRDI QIDQ6487447zbMATH OpenFDO

Authors Grammati Pantziou, Alan Roberts, Antonios Symvonis

Publication date 25 January 2023

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network design and communication in computer systems (68M10)

Recommendations

• Many-to-many routing on trees via matchings
• Routing on trees via matchings
• On-line matching routing on trees
• Optimal Bounds for Matching Routing on Trees
• Routing on trees

Cites work

• scientific article; zbMATH DE number 1256693 (Why is no real title available?)
• Bounds on evacuation time for deflection routing
• Routing Permutations on Graphs via Matchings
• Routing on trees via matchings

Cited in

(2)

• On-line matching routing on trees
• Many-to-many routing on trees via matchings

This page was built for publication: Dynamic tree routing under the “matching with consumption” model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487447)