ACM Symposium on Discrete Algorithms, SODA 2015


Article Details
Title: On the Quickest Flow Problem in Dynamic Networks - A Parametric Min-Cost Flow Approach
Article URLs:
Alternative Article URLs:
Authors: Maokai Lin
  • MIT, Operations Research Center
Patrick Jaillet
  • MIT, Department of Electrical Engineering and Computer Science
  • MIT, Operations Research Center
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/soda/LinJ15
Author Comments:

Discuss this paper and its artifacts below