Answers are grounded in this paper and cite their sources.
We examine a class of problems that seeks to find tree‐structured networks that minimize the maximum cost among a subset of nodes in a graph. The cost metric is characterized by a series of parameters that can represent distance, flow volume, and delivery deadlines. Derived through variations in problem parameters, we present 17 different problems and discuss their worst‐case complexities. Fourteen of the problems are new to the literature. We show that some of the problems are 𝒩𝒫‐Complete and others are polynomially solvable.
No takes yet. Share an insight, caveat, or question.
Chen et al. (2009) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: