THE OPTIMAL LOCATION OF A STRUCTURED FACILITY IN A TREE NETWORK
From MaRDI portal
Publication:4819980
DOI10.1080/10637199408915406zbMATH Open1049.68507OpenAlexW2120218603MaRDI QIDQ4819980FDOQ4819980
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
Cites Work
- Title not available (Why is that?)
- 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
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
- A simple parallel tree contraction algorithm
- On Locating a Facility to Service Areas within a Network
Cited In (1)
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)