Algorithms for online car-sharing problem

DOI10.1007/978-3-030-95018-7_18MaRDI QIDQ6102279zbMATH OpenOpenAlexFDO

Authors Xiangyu Guo, Kelin Luo

Publication date 8 May 2023

Published in Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-95018-7_18

zbMATH Keywords

car-sharingcompetitive analysisonline matching

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A robust and optimal online algorithm for minimum metric bipartite matching
• Approximation algorithms for car-sharing problems
• Approximation and Online Algorithms
• Computer-aided complexity classification of dial-a-ride problems
• Dial a ride from k-forest
• scientific article; zbMATH DE number 1629830 (Why is no real title available?)
• On-line single-server dial-a-ride problems
• Online Weighted Matching

Cited in

(6)

• Car-sharing problem: online scheduling with flexible advance bookings
• Algorithmic Analysis for Ridesharing of Personal Vehicles
• The optimality of the online greedy algorithm in carpool and chairman assignment problems
• Car-sharing between two locations: online scheduling with flexible advance bookings
• Efficient algorithms for ridesharing of personal vehicles
• Online car-sharing problem with variable booking times

This page was built for publication: Algorithms for online car-sharing problem

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