The online food delivery problem on stars

DOI10.1016/j.tcs.2022.06.007OpenAlexW4281672696MaRDI QIDQ2079861

Xiangyu Guo, Kelin Luo, Zhihao Gavin Tang, Yu-Hao Zhang

Publication date: 7 October 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.06.007

zbMATH Keywords

competitive analysispickup and delivery problemflow-time scheduling

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Minimizing the maximum flow time in the online food delivery problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• News from the online traveling repairman.
• The Online TSP Against Fair Adversaries
• Approximation algorithms for deadline-TSP and vehicle routing with time-windows
• Hardness of Preemptive Finite Capacity Dial-a-Ride
• Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling
• Tight Bounds for Online TSP on the Line
• Car-sharing on a star network: on-line scheduling with k servers
• A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time
• Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach
• Approximation and Online Algorithms
• Algorithms for the on-line travelling salesman
• On-line single-server dial-a-ride problems

This page was built for publication: The online food delivery problem on stars