THE OPTIMAL LOCATION OF A STRUCTURED FACILITY IN A TREE NETWORK

DOI10.1080/10637199408915406zbMath1049.68507OpenAlexW2120218603MaRDI QIDQ4819980

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)

Related Items (1)

On coding labeled trees

Cites Work

• Unnamed Item
• The optimal location of a path or tree in a tree network
• 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
• A simple parallel tree contraction algorithm
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems

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