Tight competitive analyses of online car-sharing problems

DOI10.4230/LIPICS.ISAAC.2021.50MaRDI QIDQ6147557zbMATH OpenFDO

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

Publication date 15 January 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ISAAC.2021.50

zbMATH Keywords

car-sharingcompetitive analysison-line schedulingrandomized algorithm

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

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

Cited in

(1)

• 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 Q6147557)