Minimax flow tree problems

Hui Chen, Ann Campbell, Barrett Thomas*, Arie Tamir

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

12 Scopus citations


We examine a class of problems that seeks to find treestructured 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 N' P-Complete and others are polynomially solvable.

Original languageEnglish
Pages (from-to)117-129
Number of pages13
Issue number3
StatePublished - Oct 2009


  • Complexity
  • Flow
  • Minimax
  • Shortestpath trees
  • Trees


Dive into the research topics of 'Minimax flow tree problems'. Together they form a unique fingerprint.

Cite this