Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

20

WAOA
2005
Springer

favoriteEmaildiscussreport

113views Algorithms» more WAOA 2005»

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

14 years 27 days ago

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

Download www.win.tue.nl

Sven Oliver Krumke, Willem de Paepe, Diana Poensge

Real-time Traffic

WAOA 2005 |

claim paper

Related Content

» Minimizing Average FlowTime

» Minimizing Average Flowtime Upper and Lower Bounds

» The Optimal Online Algorithms for Minimizing Maximum Lateness

» An Online Scalable Algorithm for Average Flow Time in Broadcast Scheduling

» Scheduling Algorithms for Procrastinators

» Sleep with Guilt and Work Faster to Minimize Flow Plus Energy

» Admission control to minimize rejections and online set cover with repetitions

» Minimization of circuit registers Retiming revisited

» Online Scheduling on Identical Machines using SRPT

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	WAOA
Authors	Sven Oliver Krumke, Willem de Paepe, Diana Poensgen, Maarten Lipmann, Alberto Marchetti-Spaccamela, Leen Stougie

Comments (0)