Routing on trees

DOI10.1016/0020-0190(95)00208-1zbMATH Open0875.68079OpenAlexW2088814615MaRDI QIDQ672097FDOQ672097

Authors: Antonios Symvonis 

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00208-1

Recommendations

• scientific article; zbMATH DE number 1756017
• Routeing on trees
• Routing on trees via matchings
• scientific article; zbMATH DE number 1303574
• Location routing problems on trees
• Semi-preemptive routing on trees
• On-line matching routing on trees
• Routing in graphs
• Many-to-many routing on trees via matchings
• On the complexity of an optimal routing tree problem

zbMATH Keywords

AlgorithmsTreesOff-line routingPermutationRouting modelRouting number

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Title not available (Why is that?)
• A unified framework for off-line permutation routing in parallel networks
• Routing permutations on graphs via matchings

Cited In (11)

• Dynamic tree routing under the “matching with consumption” model
• Navigation in tree spaces
• Semi-preemptive routing on trees
• Permutation routing and \((\ell , k)\)-routing on plane grids
• ON THE ROUTING NUMBER OF COMPLETE d-ARY TREES
• Rotor-routing on Galton-Watson trees
• Routeing on trees
• How to sort by walking on a tree
• Direct routing: Algorithms and complexity
• Title not available (Why is that?)
• Routing on trees via matchings

This page was built for publication: Routing on trees

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