Minimax flow tree problems

Hui Chen; Ann Campbell; Barrett Thomas; Arie Tamir

doi:10.1002/net.20313

Minimax flow tree problems

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

^*Corresponding author for this work

School of Mathematical Sciences

University of Iowa

Research output: Contribution to journal › Article › peer-review

12 Scopus citations

Abstract

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 language	English
Pages (from-to)	117-129
Number of pages	13
Journal	Networks
Volume	54
Issue number	3
DOIs	https://doi.org/10.1002/net.20313
State	Published - Oct 2009

Keywords

Complexity
Flow
Minimax
Shortestpath trees
Trees

Access to Document

10.1002/net.20313

Cite this

@article{ff0a1c8d32bf4aa1a30269583a7906f0,

title = "Minimax flow tree problems",

abstract = "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.",

keywords = "Complexity, Flow, Minimax, Shortestpath trees, Trees",

author = "Hui Chen and Ann Campbell and Barrett Thomas and Arie Tamir",

year = "2009",

month = oct,

doi = "10.1002/net.20313",

language = "אנגלית",

volume = "54",

pages = "117--129",

journal = "Networks",

issn = "0028-3045",

publisher = "Wiley-Liss Inc.",

number = "3",

}

TY - JOUR

T1 - Minimax flow tree problems

AU - Chen, Hui

AU - Campbell, Ann

AU - Thomas, Barrett

AU - Tamir, Arie

PY - 2009/10

Y1 - 2009/10

N2 - 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.

AB - 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.

KW - Complexity

KW - Flow

KW - Minimax

KW - Shortestpath trees

KW - Trees

UR - http://www.scopus.com/inward/record.url?scp=70349316531&partnerID=8YFLogxK

U2 - 10.1002/net.20313

DO - 10.1002/net.20313

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:70349316531

SN - 0028-3045

VL - 54

SP - 117

EP - 129

JO - Networks

JF - Networks

IS - 3

ER -

Minimax flow tree problems

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this