scientific article; zbMATH DE number 7204578

DOI10.4230/LIPICS.ICALP.2017.126zbMATH Open1442.68274arXiv1705.05755MaRDI QIDQ5111458FDOQ5111458

Authors: Sina Dehghani, Soheil Ehsani, Vahid Liaghat, S. Seddighin, Mohammad T. Hajiaghayi 

Publication date: 27 May 2020

Full work available at URL: https://arxiv.org/abs/1705.05755

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

stochasticcompetitive ratioonline algorithm\(k\)-server

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Combinatorial optimization (90C27)

Cited In (10)

• Online \(k\)-taxi via double coverage and time-reverse primal-dual
• Online Metric Algorithms with Untrusted Predictions
• Approximation algorithms for clustering with dynamic points
• Approximation algorithms for clustering with dynamic points
• Stochastic online metric matching
• Online \(k\)-taxi via double coverage and time-reverse primal-dual
• Prophet secretary for combinatorial auctions and matroids
• 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
• Online spatio-temporal matching in stochastic and dynamic domains

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)