Cover Image

A greedy approach for increased vehicle utilization in ridesharing networks

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Makhdomi, Aqsa Ashraf, Gillani, Iqra Altaf
Format:	Preprint
Published:	2023
Subjects:	Data Structures and Algorithms Computers and Society Information Retrieval Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fair and Efficient Ridesharing: A Dynamic Programming-based Relocation Approach
by: Makhdomi, Aqsa Ashraf, et al.
Published: (2024)

Predict, Reposition, and Allocate: A Greedy and Flow-Based Architecture for Sustainable Urban Food Delivery
by: Makhdomi, Aqsa Ashraf, et al.
Published: (2025)

Error-Tolerant E-Discovery Protocols
by: Dong, Jinshuo, et al.
Published: (2024)

Expected Maximin Fairness in Max-Cut and other Combinatorial Optimization Problems
by: Salem, Jad, et al.
Published: (2024)

Parallel Algorithms for Median Consensus Clustering in Complex Networks
by: Hussain, Md Taufique, et al.
Published: (2024)

The Lovász Theta Function for Recovering Planted Clique Covers and Graph Colorings
by: Hou, Jiaxin, et al.
Published: (2023)

Polyamorous Scheduling
by: Gąsieniec, Leszek, et al.
Published: (2024)

Dynamic Curing and Network Design in SIS Epidemic Processes
by: Yi, Yuhao, et al.
Published: (2022)

Hierarchical Locality Sensitive Hashing for Structured Data: A Survey
by: Wu, Wei, et al.
Published: (2022)

Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data
by: Li, Xiaoyu, et al.
Published: (2025)

Bridging Classical and Quantum String Matching: A Computational Reformulation of Bit-Parallelism
by: Faro, Simone, et al.
Published: (2025)

Foundations of Vector Retrieval
by: Bruch, Sebastian
Published: (2024)

On the LSH Distortion of Ulam and Cayley Similarities
by: Chierichetti, Flavio, et al.
Published: (2026)

Protecting participants or population? Comparison of k-anonymous Origin-Destination matrices
by: Armenante, Pietro, et al.
Published: (2025)

Efficient Top-k s-Biplexes Search over Large Bipartite Graphs
by: Xu, Zhenxiang, et al.
Published: (2024)

Fast and exact fixed-radius neighbor search based on sorting
by: Chen, Xinye, et al.
Published: (2022)

Streaming Stochastic Submodular Maximization with On-Demand User Requests
by: Wang, Honglian, et al.
Published: (2026)

Prune, Don't Rebuild: Efficiently Tuning $α$-Reachable Graphs for Nearest Neighbor Search
by: Zhang, Tian, et al.
Published: (2026)

An Effective Tag Assignment Approach for Billboard Advertisement
by: Ali, Dildar, et al.
Published: (2024)

Average Case Graph Searching in Non-Uniform Cost Models
by: Szyfelbein, Michał
Published: (2026)

Testing Identity of Distributions under Kolmogorov Distance in Polylogarithmic Space
by: Lebeda, Christian Janos, et al.
Published: (2024)

Deterministic Retrieval at Scale: Optimal-Space LCP Indexing and 308x Energy Reduction on Modern GPUs
by: Byriukov, Stanislav
Published: (2026)

Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search
by: Gottesbüren, Lars, et al.
Published: (2024)

Efficient Inference of Sub-Item Id-based Sequential Recommendation Models with Millions of Items
by: Petrov, Aleksandr V., et al.
Published: (2024)

Dynamic Boundary Time Warping for Sub-sequence Matching with Few Examples
by: Borchmann, Łukasz, et al.
Published: (2020)

AiSAQ: All-in-Storage ANNS with Product Quantization for DRAM-free Information Retrieval
by: Tatsuno, Kento, et al.
Published: (2024)

A Decomposition Theorem for Dynamic Flows
by: Graf, Lukas, et al.
Published: (2024)

A Faster Parametric Search for the Integral Quickest Transshipment Problem
by: Anapolska, Mariia, et al.
Published: (2025)

A nearly optimal randomized algorithm for explorable heap selection
by: Borst, Sander, et al.
Published: (2022)

A Variational-Calculus Approach to Online Algorithm Design and Analysis
by: Xu, Pan
Published: (2025)

A First Order Method for Linear Programming Parameterized by Circuit Imbalance
by: Cole, Richard, et al.
Published: (2023)

A rounding and clustering-based exact algorithm for the p-center problem
by: Ales, Zacharie, et al.
Published: (2024)

A Control-Theoretic Perspective on Optimal High-Order Optimization
by: Lin, Tianyi, et al.
Published: (2019)

A Unified Algorithmic Framework for Dynamic Assortment Optimization under MNL Choice
by: Sun, Shuo, et al.
Published: (2024)

A Two-Layer Framework for Joint Online Configuration Selection and Admission Control
by: Shen, Owen, et al.
Published: (2026)

A Continuous-Time Perspective on Global Acceleration for Monotone Equation Problems
by: Lin, Tianyi, et al.
Published: (2022)

A note on the complexity of the picker routing problem in multi-block warehouses and related problems
by: Prunet, Thibault, et al.
Published: (2023)

Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods
by: Li, Gen, et al.
Published: (2023)

Gap-Free Clustering: Sensitivity and Robustness of SDP
by: Zurek, Matthew, et al.
Published: (2023)

Labeling Methods for Partially Ordered Paths
by: Euler, Ricardo, et al.
Published: (2023)