Login / Signup

On Algorithms for Minimum-Cost Quickest Paths with Multiple Delay-Bounds.

Young-Cheol BangInki HongSungchang LeeByungJun Ahn
Published in: ICCSA (1) (2004)
Keyphrases
  • minimum cost
  • minimum cost flow
  • approximation algorithms
  • worst case
  • np hard
  • upper bound
  • lower bound
  • network flow
  • network flow problem