Login / Signup

On Minimizing the Maximum Flow Time in the Online Dial-a-Ride Problem.

Sven Oliver KrumkeWillem de PaepeDiana PoensgenMaarten LipmannAlberto Marchetti-SpaccamelaLeen Stougie
Published in: WAOA (2005)
Keyphrases
  • maximum flow
  • minimum cut
  • directed graph
  • computer vision
  • directed networks
  • push relabel
  • object recognition
  • column generation