scientific article; zbMATH DE number 7204578
From MaRDI portal
Publication:5111458
Recommendations
- Stochastic ridesharing user equilibrium in transport networks
- Stochastic analysis of the k-server problem on the circle
- scientific article; zbMATH DE number 90115
- Dynamic and stochastic rematching for ridesharing systems: formulations and reductions
- Mix and match: Markov chains and mixing times for matching in rideshare
- The Online Transportation Problem: On the Exponential Boost of One Extra Server
- The \(k\)-server problem
- Fast, Exact and Scalable Dynamic Ridesharing
- scientific article; zbMATH DE number 1629851
- Delivery systems with crowd‐sourced drivers: A pickup and delivery problem with transfers
Cited in
(13)- Online spatio-temporal matching in stochastic and dynamic domains
- Approximation algorithms for clustering with dynamic points
- An optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals
- Stochastic analysis of the k-server problem on the circle
- Stochastic online metric matching
- Approximation algorithms for clustering with dynamic points
- Online \(k\)-taxi via double coverage and time-reverse primal-dual
- Online \(k\)-taxi via double coverage and time-reverse primal-dual
- Online Metric Algorithms with Untrusted Predictions
- Prophet secretary for combinatorial auctions and matroids
- Distributional online weighted paging with limited horizon
- Beating competitive ratio 4 for graphic matroid secretary
- Smoothed analysis of online metric problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111458)
