An improved algorithm for open online dial-a-ride

DOI10.1007/978-3-031-18367-6_8arXiv2210.13854OpenAlexW4307416759MaRDI QIDQ6176557

Júlia Baligács, Nils Mosis, Yann Disser, David Weckbecker

Publication date: 25 July 2023

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

competitive analysisdial-a-rideonline optimization

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Tight analysis of the lazy algorithm for open online dial-a-ride

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for the on-line quota traveling salesman problem
• Online \(k\)-server routing problems
• News from the online traveling repairman.
• On-line dial-a-ride problems under a restricted information model
• Online travelling salesman problem on a circle
• The Online TSP Against Fair Adversaries
• Online traveling salesman problems with service flexibility
• Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line
• Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses
• Online traveling salesman problems with rejection options
• Tight Bounds for Online TSP on the Line
• Competitive analysis of the online dial-a-ride problem
• An Improved Online Algorithm for the Traveling Repairperson Problem on a Line
• Algorithmic Applications in Management
• Computing and Combinatorics
• Approximation and Online Algorithms
• Theory and Applications of Models of Computation
• Algorithms for the on-line travelling salesman
• Euler is standing in line dial-a-ride problems with precedence-constraints
• On-line single-server dial-a-ride problems

This page was built for publication: An improved algorithm for open online dial-a-ride