Routing on trees
type: Item
instance of: scholarly article
title: Routing on trees
zbMATH Open document ID: 0875.68079
DOI: 10.1016/0020-0190(95)00208-1
author: Antonios Symvonis
published in: Information Processing Letters
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 984787
zbMATH Keywords: Algorithms
zbMATH Keywords: Off-line routing
zbMATH Keywords: Permutation
zbMATH Keywords: Routing number
zbMATH Keywords: Routing model
zbMATH Keywords: Trees
MaRDI profile type: Publication
full work available at URL: 0020-0190(95)00208-1
OpenAlex ID: W2088814615
cites work: Routing permutations on graphs via matchings
cites work: A unified framework for off-line permutation routing in parallel networks
cites work: Q3883524
Recommended article: Q4535803
Recommended article: Routeing on trees
Recommended article: Routing on trees via matchings
Recommended article: Q4250200
Recommended article: Location routing problems on trees
Recommended article: Semi-preemptive routing on trees
Recommended article: On-line matching routing on trees
Recommended article: Q3162565
Recommended article: Many-to-many routing on trees via matchings
Recommended article: On the complexity of an optimal routing tree problem
description: scientific article; zbMATH DE number 984787