Imagen de Portada

Fair and Efficient Ridesharing: A Dynamic Programming-based Relocation Approach

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Makhdomi, Aqsa Ashraf, Gillani, Iqra Altaf
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

A greedy approach for increased vehicle utilization in ridesharing networks
por: Makhdomi, Aqsa Ashraf, et al.
Publicado: (2023)

GNN-based Passenger Request Prediction
por: Makhdomi, Aqsa Ashraf, et al.
Publicado: (2023)

A Dynamic Programming Approach to Evader Pathfinding in Static Pursuit Scenarios
por: Samanta, Sukanya, et al.
Publicado: (2025)

The Longest Common Bitonic Subsequence: A Match-Sensitive Dynamic Programming Approach
por: Rahat, Md. Tanzeem, et al.
Publicado: (2025)

Maximal Covering Location Problem: A Set Coverage Approach Using Dynamic Programming
por: Samanta, Sukanya, et al.
Publicado: (2025)

Multiagent Matroid Upgrading: Greedy is Fair and Efficient
por: Ma, Qingwen, et al.
Publicado: (2026)

Efficient Approximation Algorithms for Fair Influence Maximization under Maximin Constraint
por: Rui, Xiaobin, et al.
Publicado: (2025)

Local Search-based Individually Fair Clustering with Outliers
por: Maity, Binita, et al.
Publicado: (2025)

Linear Programming based Approximation to Individually Fair k-Clustering with Outliers
por: Maity, Binita, et al.
Publicado: (2024)

Randomized Rounding over Dynamic Programs
por: Bamas, Etienne, et al.
Publicado: (2025)

From Dynamic Programs to Greedy Algorithms
por: van Melkebeek, Dieter
Publicado: (2025)

Space-Efficient Algorithm for Integer Programming with Few Constraints
por: Rohwedder, Lars, et al.
Publicado: (2024)

Fair Set Cover
por: Dehghankar, Mohsen, et al.
Publicado: (2024)

A Simple and Fast Algorithm for Fair Cuts
por: Li, Jason, et al.
Publicado: (2024)

Directed Isoperimetry and Monotonicity Testing: A Dynamical Approach
por: Pinto Jr, Renato Ferreira
Publicado: (2024)

Efficient Dynamic Rank Aggregation
por: Alimi, Morteza, et al.
Publicado: (2025)

Optimal Extended Formulations from Optimal Dynamic Programming Algorithms
por: Oliveira, Mateus de Oliveira, et al.
Publicado: (2026)

Individual Fairness in Graph Decomposition
por: Munagala, Kamesh, et al.
Publicado: (2024)

Efficient Contractions of Dynamic Graphs -- with Applications
por: Henzinger, Monika, et al.
Publicado: (2025)

Fair Center Clustering in Sliding Windows
por: Ceccarello, Matteo, et al.
Publicado: (2025)

Fair Diversity Maximization with Few Representatives
por: Adriaens, Florian, et al.
Publicado: (2025)

Approximation Algorithms for Fair Repetitive Scheduling
por: Hermelin, Danny, et al.
Publicado: (2025)

Fair Clustering in the Sliding Window Model
por: Cohen-Addad, Vincent, et al.
Publicado: (2025)

Efficient Resource Allocation under Adversary Attacks: A Decomposition-Based Approach
por: Davoodi, Mansoor, et al.
Publicado: (2025)

Proportionally Fair Matching via Randomized Rounding
por: Duppala, Sharmila, et al.
Publicado: (2024)

Improved Rank Aggregation under Fairness Constraint
por: Chakraborty, Diptarka, et al.
Publicado: (2025)

Facility Location and $k$-Median with Fair Outliers
por: Dabas, Rajni, et al.
Publicado: (2025)

Fair densest subgraph across multiple graphs
por: Arachchi, Chamalee Wickrama, et al.
Publicado: (2025)

Logarithmic Approximations for Fair k-Set Selection
por: Li, Shi, et al.
Publicado: (2025)

Improved Algorithms for Fair Matroid Submodular Maximization
por: Mahabadi, Sepideh, et al.
Publicado: (2026)

Fair Correlation Clustering Meets Graph Parameters
por: Blaha, Johannes, et al.
Publicado: (2026)

On Fair Epsilon Net and Geometric Hitting Set
por: Dehghankar, Mohsen, et al.
Publicado: (2025)

Matching Composition and Efficient Weight Reduction in Dynamic Matching
por: Bernstein, Aaron, et al.
Publicado: (2024)

FPT Approximations for Fair $k$-Min-Sum-Radii
por: Carta, Lena, et al.
Publicado: (2024)

Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints
por: Inamdar, Tanmay, et al.
Publicado: (2024)

Bicriteria Algorithms for Submodular Cover with Partition and Fairness Constraints
por: Chen, Wenjing, et al.
Publicado: (2026)

Creating Robust and Fair Graph Structures for Connectivity and Clustering
por: Chatterjee, Kushagra
Publicado: (2026)

Fair Submodular Maximization over a Knapsack Constraint
por: Li, Lijun, et al.
Publicado: (2025)

Fast Biclique Counting on Bipartite Graphs: A Node Pivot-based Approach
por: Ye, Xiaowei, et al.
Publicado: (2024)