Tight competitive analyses of online car-sharing problems

DOI10.1016/J.TCS.2022.10.010MaRDI QIDQ2089695zbMATH OpenOpenAlexFDO

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

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

car-sharingcompetitive analysison-line schedulingrandomized algorithm

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Tight competitive analyses of online car-sharing problems
• Car-sharing problem: online scheduling with flexible advance bookings
• Car-sharing on a star network: on-line scheduling with k servers
• Car-sharing between two locations: online scheduling with two servers
• Car-sharing between two locations: online scheduling with flexible advance bookings

Cites work

• Algorithmic Applications in Management
• Approximation algorithms for car-sharing problems
• Approximation and Online Algorithms
• Car-sharing between two locations: online scheduling with flexible advance bookings
• Car-sharing between two locations: online scheduling with two servers
• From theory to practice: maximizing revenues for on-line dial-a-ride
• scientific article; zbMATH DE number 1629830 (Why is no real title available?)
• Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings.
• Scheduling transfers of resources over time: towards car-sharing with flexible drop-offs
• Tight bounds for online TSP on the line

Cited in

(3)

• Exact solutions to a carsharing pricing and relocation problem under uncertainty
• Car-sharing problem: online scheduling with flexible advance bookings
• Tight competitive analyses of online car-sharing problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2089695)