Tight competitive analyses of online car-sharing problems

DOI10.1016/j.tcs.2022.10.010OpenAlexW3158912225MaRDI QIDQ2089695

Ya-Chun Liang, Kazuo Iwama, Kuan-Yun Lai, Chung-Shou Liao, Ho-Lin Chen

Publication date: 24 October 2022

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

Full work available at URL: https://arxiv.org/abs/2103.07367

zbMATH Keywords

competitive analysisrandomized algorithmon-line schedulingcar-sharing

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• From theory to practice: maximizing revenues for on-line dial-a-ride
• Approximation algorithms for car-sharing problems
• Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs
• Tight Bounds for Online TSP on the Line
• Car-Sharing between Two Locations: Online Scheduling with Two Servers
• Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings.
• Algorithmic Applications in Management
• Approximation and Online Algorithms
• Car-sharing between two locations: online scheduling with flexible advance bookings

This page was built for publication: Tight competitive analyses of online car-sharing problems