An O(nlogn/logw) Time Algorithm for Ridesharing

7 pages•Published: March 1, 2021

Abstract

In the ridesharing problem different people share private vehicles because they have similar itineraries. The objective of solving the ridesharing problem is to minimize the number of drivers needed to carry all load to the destination. The general case of ridesharing problem is NP-complete. For the special case where the network is a chain and the destination is the leftmost vertex of the chain, we present an O(nlogn/logw) time algorithm for the ridesharing problem, where w is the word length used in the algorithm and is at least logn. Previous achieved algorithm for this case requires O(nlogn) time.

Keyphrases: data engineering, efficient algorithms, ride sharing, time complexity

In: Alex Redei, Rui Wu and Frederick Harris (editors). SEDE 2020. 29th International Conference on Software Engineering and Data Engineering, vol 76, pages 49-55.

Links:	https://easychair.org/publications/paper/1mt6
	https://doi.org/10.29007/gl1k

BibTeX entry

@inproceedings{SEDE2020:O(nlogn/logw)_Time_Algorithm_Ridesharing,
  author    = {Yijie Han and Chen Sun},
  title     = {An O(nlogn/logw) Time Algorithm for Ridesharing},
  booktitle = {SEDE 2020. 29th International Conference on Software Engineering and Data Engineering},
  editor    = {Alex Redei and Rui Wu and Frederick Harris},
  series    = {EPiC Series in Computing},
  volume    = {76},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/1mt6},
  doi       = {10.29007/gl1k},
  pages     = {49-55},
  year      = {2021}}

Download PDF Open PDF in browser