An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times

Alexander Hall, Katharina Langkau, Martin Skutella. An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times. In Sanjeev Arora, Klaus Jansen, José D. P. Rolim, Amit Sahai, editors, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approx. Volume 2764 of Lecture Notes in Computer Science, pages 71-82, Springer, 2003. [doi]

@inproceedings{HallLS03,
  title = {An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times},
  author = {Alexander Hall and Katharina Langkau and Martin Skutella},
  year = {2003},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2764&spage=71},
  tags = {data-flow},
  researchr = {https://researchr.org/publication/HallLS03},
  cites = {0},
  citedby = {0},
  pages = {71-82},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approx},
  editor = {Sanjeev Arora and Klaus Jansen and José D. P. Rolim and Amit Sahai},
  volume = {2764},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-40770-7},
}