On the complexity of an optimal routing tree problem

DOI10.1007/BF02006188zbMath0676.90091OpenAlexW2016093718MaRDI QIDQ1123140

Ding-Zhu Du, Ker-I. Ko

Publication date: 1989

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02006188

zbMATH Keywords

set packingNP-completedecision treeminimum costrouting tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Deterministic scheduling theory in operations research (90B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

In Memoriam: Ker-I Ko (1950–2018) ⋮ Maximum information stored in a labeled connected network with minimum edges ⋮ On complexity of subset interconnection designs

This page was built for publication: On the complexity of an optimal routing tree problem