THE OPTIMAL LOCATION OF A STRUCTURED FACILITY IN A TREE NETWORK

DOI10.1080/10637199408915406MaRDI QIDQ4819980zbMATH OpenOpenAlexFDO

Authors Shietung Peng, Win-Tsung Lo

Publication date 6 October 2004

Published in Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10637199408915406

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites work

• scientific article; zbMATH DE number 3847184 (Why is no real title available?)
• A simple parallel tree contraction algorithm
• Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
• On Locating a Facility to Service Areas within a Network
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• The optimal location of a path or tree in a tree network

Cited in

(1)

• On coding labeled trees

This page was built for publication: THE OPTIMAL LOCATION OF A STRUCTURED FACILITY IN A TREE NETWORK

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