Minimizing the Maximum Flow Time in the Online Food Delivery Problem
- 31 October 2023
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 86 (4) , 907-943
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (72071157, 62102251)
This publication has 36 references indexed in Scilit:
- Broadcast schedulingACM Transactions on Algorithms, 2011
- Dial a Ride from k -forestACM Transactions on Algorithms, 2010
- A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing2010
- Minimum Makespan Multi-vehicle Dial-a-RideLecture Notes in Computer Science, 2009
- Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling2009
- Optimal on-line flow time with resource augmentationDiscrete Applied Mathematics, 2006
- SCHEDULING TO MINIMIZE MAX FLOW TIME: OFF-LINE AND ON-LINE ALGORITHMSInternational Journal of Foundations of Computer Science, 2004
- News from the online traveling repairmanTheoretical Computer Science, 2003
- On-line single-server dial-a-ride problemsTheoretical Computer Science, 2001
- Speed is as powerful as clairvoyanceJournal of the ACM, 2000