The Complexity of Finding Two Disjoint Paths with Min Max Objective Function

Submitted by kerrigan@mit.edu on

TitleThe Complexity of Finding Two Disjoint Paths with Min Max Objective Function
Publication TypeJournal Article
Year of Publication1990
AuthorsLi C.L, McCormick S.T, Simchi-Levi D.
JournalDiscrete Applied Mathematics
Volume26
Start Page105-115
Date Published1990

Type: 

Theory