Algorithms for online car-sharing problem

DOI10.1007/978-3-030-95018-7_18OpenAlexW4207022808MaRDI QIDQ6102279

Kelin Luo, Xiangyu Guo

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

competitive analysisonline matchingcar-sharing

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Online car-sharing problem with variable booking times

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation algorithms for car-sharing problems
• Computer-Aided Complexity Classification of Dial-a-Ride Problems
• Minimum Makespan Multi-vehicle Dial-a-Ride
• A Robust and Optimal Online Algorithm for Minimum Metric Bipartite Matching
• Online Weighted Matching
• Approximation and Online Algorithms
• On-line single-server dial-a-ride problems

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