Abstract
The Maximum Carpool Matching problem is a star packing problem in directed graphs. Formally, given a directed graph \(G = (V, A)\), a capacity function \(c: V \rightarrow {\mathbb {N}}\), and a weight function \(w: A \rightarrow {\mathbb {R}}^+\), a carpool matching is a subset of arcs, \(M \subseteq A\), such that every \(v \in V\) satisfies: (1) \(d^{\text {in}}_{M}(v) \cdot d^{\text {out}}_{M}(v) = 0\), (2) \(d^{\text {in}}_{M}(v) \le c(v)\), and (3) \(d^{\text {out}}_{M}(v) \le 1\). A vertex v for which \(d^{\text {out}}_{M}(v) = 1\) is a passenger, and a vertex for which \(d^{\text {out}}_{M}(v) = 0\) is a driver who has \(d^{\text {in}}_{M}(v)\) passengers. In the Maximum Carpool Matching problem the goal is to find a carpool matching M of maximum total weight. The problem arises when designing an online carpool service, such as Zimride (Zimride by enterprise. https://zimride.com/), which tries to connect between users based on a similarity function. The problem is known to be NP-hard, even in the unweighted and uncapacitated case. The Maximum Group Carpool Matching problem, is an extension of the Maximum Carpool Matching where each vertex represents an unsplittable group of passengers. Formally, each vertex \(u \in V\) has a size \(s(u) \in {\mathbb {N}}\), and the constraint \(d^{\text {in}}_{M}(v) \le c(v)\) is replaced with \(\sum _{u:(u,v) \in M} s(u) \le c(v)\). We show that Maximum Carpool Matching can be formulated as an unconstrained submodular maximization problem, thus it admits a \(\frac{1}{2}\)-approximation algorithm. We show that the same formulation does not work for Maximum Group Carpool Matching, nevertheless, we present a local search \((\frac{1}{2} - \varepsilon )\)-approximation algorithm for Maximum Group Carpool Matching. For the unweighted variant of both problems when the maximum possible capacity, \(c_{\max }\), is bounded by a constant, we provide a local search \((\frac{1}{2}+ \frac{1}{2c_{\max }} - \varepsilon )\)-approximation algorithm. We also provide an APX-hardness result, even if the maximum degree and \(c_{\max }\) are at most 3.
Similar content being viewed by others
References
Agatz, N.A.H., Erera, A.L., Savelsbergh, M.W.P., Wang, X.: Optimization for dynamic ride-sharing: a review. Eur. J. Oper. Res. 223(2), 295–303 (2012)
Arkin, E.M., Hassin, R., Rubinstein, S., Sviridenko, M.: Approximations for maximum transportation with permutable supply vector and other capacitated star packing problems. Algorithmica 39(2), 175–187 (2004)
Athanassopoulos, S., Caragiannis, I., Kaklamanis, C., Kyropoulou, M.: An improved approximation bound for spanning star forest and color saving. In: 34th International Symposium on Mathematical Foundations of Computer Science, pp. 90–101 (2009)
Blablacar. https://www.blablacar.com
Bar-Noy, A., Peleg, D., Rabanca, G., Vigan, I.: Improved approximation algorithms for weighted 2-path partitions. In: 23rd Annual European Symposium on Algorithms, Lecture Notes in Computer Science, vol. 9294, pp. 953–964 (2015)
Berman, P.: A $d/2$ approximation for maximum weight independent set in $d$-claw free graphs. Nord. J. Comput. 7(3), 178–184 (2000)
Buchbinder, N., Feldman, M.: Deterministic algorithms for submodular maximization problems. In: 27th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 392–403 (2016)
Buchbinder, N., Feldman, M., Naor, J., Schwartz, R.: A tight linear time (1/2)-approximation for unconstrained submodular maximization. SIAM J. Comput. 44(5), 1384–1402 (2015)
Chakrabarty, D., Goel, G.: On the approximability of budgeted allocations and improved lower bounds for submodular welfare maximization and GAP. SIAM J. Comput. 39(6), 2189–2211 (2010)
Chandra, B., Halldórsson, M.M.: Greedy local improvement and weighted set packing approximation. J. Algorithms 39(2), 223–240 (2001)
Chen, N., Engelberg, R., Nguyen, C.T., Raghavendra, P., Rudra, A., Singh, G.: Improved approximation algorithms for the spanning star forest problem. Algorithmica 65(3), 498–516 (2013)
Hartman, I.B.-A.: Optimal assignment for carpooling (submitted)
Hartman, I.B.-A., Keren, D., Dbai, A.A., Cohen, E., Knapen, L., Yasar, A.-U.-H., Janssens, D.: Theory and practice in large carpooling problems. In: 5th International Conference on Ambient Systems, Networks and Technologies, pp. 339–347 (2014)
Knapen, L., Keren, D., Yasar, A.-U.-H., Cho, S., Bellemans, T., Janssens, D., Wets, G.: Estimating scalability issues while finding an optimal assignment for carpooling. In: 4th International Conference on Ambient Systems, Networks and Technologies, pp. 372–379 (2013)
Knapen, L., Yasar, A.-U.-H., Cho, S., Keren, D., Dbai, A.A., Bellemans, T., Janssens, D., Wets, G., Schuster, A., Sharfman, I., Bhaduri, K.: Exploiting graph-theoretic tools for matching in carpooling applications. J. Ambient Intell. Hum. Comput. 5(3), 393–407 (2014)
Kutiel, G.: Approximation algorithms for the maximum carpool matching problem. In: 12th International Computer Science Symposium in Russia, Lecture Notes in Computer Science, vol. 10304, pp. 206–216 (2017)
Moovit carpool. https://moovitapp.com/
Nguyen, C.T., Shen, J., Hou, M., Sheng, L., Miller, W., Zhang, L.: Approximating the spanning star forest problem and its application to genomic sequence alignment. SIAM J. Comput. 38(3), 946–962 (2008)
Papadimitriou, C., Yannakakis, M.: Optimization, approximation, and complexity classes. In 12th Annual ACM Symposium on Theory of Computing, pp. 229–234 (1988)
Waze. https://www.waze.com/
Zimride by enterprise. https://zimride.com/
Acknowledgements
We thank David Adjiashvili and Reuven Bar-Yehuda for helpful discussions. We also thank the anonymous referees for their helpful comments and suggestions.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
A preliminary version was presented at the 25th Annual European Symposium on Algorithms, 2017. D. Rawitz: Supported in part by the Israel Science Foundation (Grant No. 497/14).
Rights and permissions
About this article
Cite this article
Kutiel, G., Rawitz, D. Local Search Algorithms for the Maximum Carpool Matching Problem. Algorithmica 82, 3165–3182 (2020). https://doi.org/10.1007/s00453-020-00719-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-020-00719-1